/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 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 ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_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 3ac23ee9420d5573e041ab9b716895f5d3bb685f ...................................................................................................................................................................................................................................................................................... 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 ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_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 3ac23ee9420d5573e041ab9b716895f5d3bb685f ...................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 14:19:23,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:19:23,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:19:23,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:19:23,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:19:23,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:19:23,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:19:23,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:19:23,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:19:23,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:19:23,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:19:23,338 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:19:23,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:19:23,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:19:23,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:19:23,347 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:19:23,348 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:19:23,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:19:23,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:19:23,366 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:19:23,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:19:23,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:19:23,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:19:23,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:19:23,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:19:23,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:19:23,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:19:23,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:19:23,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:19:23,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:19:23,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:19:23,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:19:23,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:19:23,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:19:23,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:19:23,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:19:23,400 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 14:19:23,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:19:23,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:19:23,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:19:23,424 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:19:23,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:19:23,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:19:23,427 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:19:23,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:19:23,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:19:23,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 14:19:23,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:19:23,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:19:23,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:19:23,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:19:23,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:19:23,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:19:23,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:19:23,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:19:23,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:19:23,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:19:23,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:19:23,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:19:23,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:19:23,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:19:23,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:19:23,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:19:23,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 14:19:23,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:19:23,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 14:19:23,434 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 -> 3ac23ee9420d5573e041ab9b716895f5d3bb685f [2018-09-20 14:19:23,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:19:23,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:19:23,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:19:23,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:19:23,511 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:19:23,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_true-unreach-call.c [2018-09-20 14:19:23,859 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6928bf6e3/0742d563581342d9951b5076ab524b70/FLAG7f786bf24 [2018-09-20 14:19:24,014 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:19:24,015 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_true-unreach-call.c [2018-09-20 14:19:24,023 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6928bf6e3/0742d563581342d9951b5076ab524b70/FLAG7f786bf24 [2018-09-20 14:19:24,042 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6928bf6e3/0742d563581342d9951b5076ab524b70 [2018-09-20 14:19:24,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:19:24,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:19:24,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:19:24,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:19:24,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:19:24,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327e7a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24, skipping insertion in model container [2018-09-20 14:19:24,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,082 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:19:24,348 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:19:24,373 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:19:24,390 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:19:24,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24 WrapperNode [2018-09-20 14:19:24,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:19:24,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:19:24,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:19:24,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:19:24,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (1/1) ... [2018-09-20 14:19:24,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:19:24,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:19:24,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:19:24,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:19:24,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (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-09-20 14:19:24,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:19:24,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:19:24,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 14:19:24,571 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-20 14:19:24,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:19:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:19:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:19:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-20 14:19:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 14:19:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-20 14:19:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:19:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:19:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:19:25,130 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:19:25,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:19:25 BoogieIcfgContainer [2018-09-20 14:19:25,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:19:25,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:19:25,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:19:25,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:19:25,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:19:24" (1/3) ... [2018-09-20 14:19:25,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642ca12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:19:25, skipping insertion in model container [2018-09-20 14:19:25,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:24" (2/3) ... [2018-09-20 14:19:25,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642ca12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:19:25, skipping insertion in model container [2018-09-20 14:19:25,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:19:25" (3/3) ... [2018-09-20 14:19:25,143 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant_true-unreach-call.c [2018-09-20 14:19:25,154 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:19:25,163 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:19:25,217 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:19:25,218 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:19:25,218 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:19:25,218 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:19:25,218 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:19:25,218 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:19:25,219 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:19:25,219 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:19:25,219 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:19:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-20 14:19:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-20 14:19:25,250 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:19:25,252 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:19:25,254 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:19:25,261 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-20 14:19:25,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:19:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:19:25,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:19:25,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:19:25,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:19:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:19:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:19:25,413 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:19:25,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:19:25,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:19:25,433 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:19:25,434 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:19:25,437 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-20 14:19:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:19:25,462 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-20 14:19:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:19:25,465 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-20 14:19:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:19:25,475 INFO L225 Difference]: With dead ends: 56 [2018-09-20 14:19:25,476 INFO L226 Difference]: Without dead ends: 26 [2018-09-20 14:19:25,480 INFO L606 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-09-20 14:19:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-20 14:19:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-20 14:19:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-20 14:19:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-20 14:19:25,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-20 14:19:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:19:25,523 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-20 14:19:25,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:19:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-20 14:19:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:19:25,524 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:19:25,524 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:19:25,525 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:19:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-20 14:19:25,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:19:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:19:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:19:25,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:19:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:19:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:19:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:19:25,589 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 14:19:25,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:19:25 BoogieIcfgContainer [2018-09-20 14:19:25,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:19:25,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:19:25,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:19:25,643 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:19:25,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:19:25" (3/4) ... [2018-09-20 14:19:25,650 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 14:19:25,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:19:25,651 INFO L168 Benchmark]: Toolchain (without parser) took 1603.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:19:25,656 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:19:25,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.08 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:19:25,660 INFO L168 Benchmark]: Boogie Preprocessor took 62.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:19:25,661 INFO L168 Benchmark]: RCFGBuilder took 651.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-09-20 14:19:25,664 INFO L168 Benchmark]: TraceAbstraction took 508.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:19:25,665 INFO L168 Benchmark]: Witness Printer took 7.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:19:25,673 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.48 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.08 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 651.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 508.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 21, overapproximation of someUnaryDOUBLEoperation at line 20, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L10] double _EPS = 1e-6; VAL [\old(_EPS)=3, _EPS=1/1000000] [L37] double d, dd, r; [L38] double epsilon = 1e-8; [L40] d = 1. VAL [_EPS=1/1000000, d=1, epsilon=1/100000000] [L40] COND TRUE d <= 20. [L42] dd = __VERIFIER_nondet_double() [L45] CALL, EXPR SqrtR(dd) VAL [\old(Input)=2, _EPS=1/1000000] [L14] double xn, xnp1, residu, lsup, linf; [L15] int i, cond; VAL [\old(Input)=2, _EPS=1/1000000, Input=2] [L16] COND TRUE Input <= 1.0 [L16] xn = 1.0 VAL [\old(Input)=2, _EPS=1/1000000, Input=2, xn=1] [L17] xnp1 = xn [L18] residu = 2.0*_EPS*(xn+xnp1) [L19] lsup = _EPS * (xn+xnp1) [L20] linf = -lsup [L21] cond = ((residu > lsup) || (residu < linf)) [L22] i = 0 VAL [\old(Input)=2, _EPS=1/1000000, cond=0, i=0, Input=2, xn=1, xn=1] [L23] COND FALSE !(\read(cond)) VAL [\old(Input)=2, _EPS=1/1000000, cond=0, i=0, Input=2, xn=1, xn=1] [L32] RET return 1.0 / xnp1; VAL [\old(Input)=2, _EPS=1/1000000, cond=0, i=0, Input=2, xn=1, xn=1] [L45] EXPR SqrtR(dd) VAL [_EPS=1/1000000, d=1, d=2, epsilon=1/100000000, SqrtR(dd)=4] [L45] r = SqrtR(dd) [L47] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) VAL [\old(cond)=0, _EPS=1/1000000] [L8] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 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=31occurred 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, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 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.23-40ef509 [2018-09-20 14:19:28,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:19:28,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:19:28,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:19:28,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:19:28,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:19:28,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:19:28,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:19:28,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:19:28,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:19:28,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:19:28,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:19:28,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:19:28,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:19:28,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:19:28,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:19:28,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:19:28,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:19:28,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:19:28,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:19:28,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:19:28,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:19:28,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:19:28,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:19:28,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:19:28,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:19:28,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:19:28,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:19:28,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:19:28,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:19:28,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:19:28,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:19:28,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:19:28,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:19:28,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:19:28,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:19:28,201 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 14:19:28,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:19:28,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:19:28,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:19:28,235 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:19:28,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:19:28,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:19:28,238 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:19:28,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:19:28,238 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:19:28,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:19:28,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:19:28,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:19:28,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:19:28,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:19:28,240 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 14:19:28,240 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 14:19:28,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:19:28,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:19:28,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:19:28,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:19:28,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:19:28,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:19:28,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:19:28,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:19:28,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:19:28,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:19:28,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:19:28,245 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 14:19:28,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:19:28,245 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 14:19:28,246 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 14:19:28,246 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 -> 3ac23ee9420d5573e041ab9b716895f5d3bb685f [2018-09-20 14:19:28,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:19:28,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:19:28,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:19:28,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:19:28,330 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:19:28,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_true-unreach-call.c [2018-09-20 14:19:28,683 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4c3a366/616575f376fa4e4bba5bd0c7baef60d4/FLAGc143c3555 [2018-09-20 14:19:28,881 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:19:28,890 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant_true-unreach-call.c [2018-09-20 14:19:28,902 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4c3a366/616575f376fa4e4bba5bd0c7baef60d4/FLAGc143c3555 [2018-09-20 14:19:28,923 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4c3a366/616575f376fa4e4bba5bd0c7baef60d4 [2018-09-20 14:19:28,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:19:28,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:19:28,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:19:28,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:19:28,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:19:28,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:19:28" (1/1) ... [2018-09-20 14:19:28,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b00919d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:28, skipping insertion in model container [2018-09-20 14:19:28,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:19:28" (1/1) ... [2018-09-20 14:19:28,958 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:19:29,173 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:19:29,192 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:19:29,206 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:19:29,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29 WrapperNode [2018-09-20 14:19:29,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:19:29,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:19:29,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:19:29,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:19:29,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (1/1) ... [2018-09-20 14:19:29,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:19:29,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:19:29,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:19:29,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:19:29,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19: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-09-20 14:19:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:19:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:19:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 14:19:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-20 14:19:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:19:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:19:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:19:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-20 14:19:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 14:19:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-20 14:19:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:19:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:19:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:19:39,651 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:19:39,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:19:39 BoogieIcfgContainer [2018-09-20 14:19:39,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:19:39,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:19:39,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:19:39,657 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:19:39,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:19:28" (1/3) ... [2018-09-20 14:19:39,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685e5c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:19:39, skipping insertion in model container [2018-09-20 14:19:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:19:29" (2/3) ... [2018-09-20 14:19:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685e5c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:19:39, skipping insertion in model container [2018-09-20 14:19:39,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:19:39" (3/3) ... [2018-09-20 14:19:39,662 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant_true-unreach-call.c [2018-09-20 14:19:39,673 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:19:39,683 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:19:39,736 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:19:39,737 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:19:39,737 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:19:39,737 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:19:39,737 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:19:39,737 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:19:39,738 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:19:39,738 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:19:39,738 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:19:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-20 14:19:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-20 14:19:39,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:19:39,766 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:19:39,769 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:19:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-20 14:19:39,781 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:19:39,782 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-09-20 14:19:39,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:19:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:19:41,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:19:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:19:41,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:19:41,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:19:41,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:19:41,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:19:41,540 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:19:41,541 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:19:41,544 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-20 14:19:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:19:41,571 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-20 14:19:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:19:41,573 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-20 14:19:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:19:41,582 INFO L225 Difference]: With dead ends: 56 [2018-09-20 14:19:41,582 INFO L226 Difference]: Without dead ends: 26 [2018-09-20 14:19:41,586 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-09-20 14:19:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-20 14:19:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-20 14:19:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-20 14:19:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-20 14:19:41,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-20 14:19:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:19:41,628 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-20 14:19:41,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:19:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-20 14:19:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:19:41,630 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:19:41,631 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:19:41,631 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:19:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-20 14:19:41,633 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:19:41,633 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-09-20 14:19:41,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 14:19:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:19:43,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:19:53,633 WARN L178 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-09-20 14:19:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:19:53,646 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:19:53,678 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:19:53,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 14:19:53,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 14:19:53,680 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 14:19:53,681 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:19:53,681 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-20 14:20:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:20:00,732 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-09-20 14:20:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 14:20:00,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-20 14:20:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:20:00,735 INFO L225 Difference]: With dead ends: 49 [2018-09-20 14:20:00,735 INFO L226 Difference]: Without dead ends: 29 [2018-09-20 14:20:00,737 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:20:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-20 14:20:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-20 14:20:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-20 14:20:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-09-20 14:20:00,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-09-20 14:20:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:20:00,745 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-09-20 14:20:00,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 14:20:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-09-20 14:20:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:20:00,747 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:20:00,747 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:20:00,747 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:20:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-09-20 14:20:00,749 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:20:00,750 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-09-20 14:20:00,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:20:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:20:05,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:20:06,133 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 14:20:06,363 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:20:08,765 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)))) is different from false [2018-09-20 14:20:11,282 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (= (_ bv1 32) c_SqrtR_~cond~0)) (.cse4 (let ((.cse6 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse6) (fp.mul RNE c_~_EPS~0 .cse6)))) (.cse0 (= (fp.div RNE .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0)) (.cse1 (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)) (.cse2 (not (fp.leq |c_SqrtR_#in~Input| .cse5)))) (or (and .cse0 .cse1 (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) v_prenex_2)) .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not .cse4) .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= (_ bv0 32) c_SqrtR_~cond~0) .cse1 .cse2)))) is different from false [2018-09-20 14:20:13,405 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (= (_ bv1 32) c_SqrtR_~cond~0)) (.cse4 (let ((.cse6 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse6) (fp.mul RNE c_~_EPS~0 .cse6)))) (.cse0 (= (fp.div RNE .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0)) (.cse1 (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)) (.cse2 (not (fp.leq |c_SqrtR_#in~Input| .cse5)))) (or (and .cse0 .cse1 (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) v_prenex_2)) .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not .cse4) .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= (_ bv0 32) c_SqrtR_~cond~0) .cse1 .cse2)))) is different from true [2018-09-20 14:20:15,870 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (let ((.cse0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0)))) (= (fp.div RNE .cse1 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse1)))) is different from false [2018-09-20 14:20:17,969 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (let ((.cse0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0)))) (= (fp.div RNE .cse1 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse1)))) is different from true [2018-09-20 14:20:20,805 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 |c_SqrtR_#in~Input|))) (and (= (fp.div RNE .cse0 .cse1) |c_SqrtR_#res|) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (let ((.cse2 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) |c_SqrtR_#in~Input|))) (fp.add RNE .cse2 .cse2))) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (not (let ((.cse3 (fp.add RNE .cse1 .cse1))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3) (fp.mul RNE c_~_EPS~0 .cse3))))))) is different from false [2018-09-20 14:20:23,290 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 |c_SqrtR_#in~Input|))) (and (= (fp.div RNE .cse0 .cse1) |c_SqrtR_#res|) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (let ((.cse2 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) |c_SqrtR_#in~Input|))) (fp.add RNE .cse2 .cse2))) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (not (let ((.cse3 (fp.add RNE .cse1 .cse1))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3) (fp.mul RNE c_~_EPS~0 .cse3))))))) is different from true [2018-09-20 14:20:26,173 WARN L797 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse3 .cse3))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (not (fp.lt .cse1 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse2)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse2)) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 (fp.mul RNE .cse4 .cse5))))))))) is different from false [2018-09-20 14:20:28,853 WARN L819 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse3 .cse3))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (not (fp.lt .cse1 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse2)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse2)) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 (fp.mul RNE .cse4 .cse5))))))))) is different from true [2018-09-20 14:20:31,708 WARN L797 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse3)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse3)) (not (fp.gt .cse2 (fp.mul RNE .cse4 .cse5))))))))) is different from false [2018-09-20 14:20:34,419 WARN L819 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse3)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse3)) (not (fp.gt .cse2 (fp.mul RNE .cse4 .cse5))))))))) is different from true [2018-09-20 14:20:58,032 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse1)) (not (fp.lt .cse3 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse1 .cse4)) (fp.leq main_~dd~0 (fp.add RNE .cse1 .cse4)) (not (fp.gt .cse3 (fp.mul RNE .cse5 .cse6)))))))))) (and (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse8 (fp.div RNE .cse7 v_prenex_4))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse8 .cse8))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse10 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12))) (and (not (fp.geq (fp.div RNE .cse7 .cse8) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse7 .cse9)) (not (fp.gt .cse10 (fp.mul RNE .cse11 .cse12))) (fp.leq v_prenex_4 (fp.add RNE .cse7 .cse9)) (not (fp.lt .cse10 v_prenex_3)) (not (fp.leq v_prenex_4 .cse7)))))))) .cse0) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse19 (fp.div RNE .cse14 v_prenex_7))) (let ((.cse17 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse18 (fp.add RNE .cse19 .cse19))) (let ((.cse16 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse17) .cse18)) (.cse15 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse13 (fp.div RNE .cse14 .cse19))) (and (fp.leq .cse13 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_7 .cse14)) (fp.leq v_prenex_7 (fp.add RNE .cse14 .cse15)) (not (fp.lt .cse16 v_prenex_6)) (not (fp.gt .cse16 (fp.mul RNE .cse17 .cse18))) (fp.geq v_prenex_7 (fp.sub RNE .cse14 .cse15)) (fp.geq .cse13 ((_ to_fp 11 53) RNE (/ 9.0 10.0)))))))))))) is different from false [2018-09-20 14:21:18,683 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse1)) (not (fp.lt .cse3 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse1 .cse4)) (fp.leq main_~dd~0 (fp.add RNE .cse1 .cse4)) (not (fp.gt .cse3 (fp.mul RNE .cse5 .cse6)))))))))) (and (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse13 (fp.div RNE .cse8 v_prenex_7))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse13 .cse13))) (let ((.cse10 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12)) (.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse7 (fp.div RNE .cse8 .cse13))) (and (fp.leq .cse7 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_7 .cse8)) (fp.leq v_prenex_7 (fp.add RNE .cse8 .cse9)) (not (fp.lt .cse10 v_prenex_6)) (not (fp.gt .cse10 (fp.mul RNE .cse11 .cse12))) (fp.geq v_prenex_7 (fp.sub RNE .cse8 .cse9)) (fp.geq .cse7 ((_ to_fp 11 53) RNE (/ 9.0 10.0))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse15 (fp.div RNE .cse14 v_prenex_4))) (let ((.cse18 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse19 (fp.add RNE .cse15 .cse15))) (let ((.cse16 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse17 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse18) .cse19))) (and (not (fp.geq (fp.div RNE .cse14 .cse15) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse14 .cse16)) (not (fp.gt .cse17 (fp.mul RNE .cse18 .cse19))) (fp.leq v_prenex_4 (fp.add RNE .cse14 .cse16)) (not (fp.lt .cse17 v_prenex_3)) (not (fp.leq v_prenex_4 .cse14))))))))))) is different from false [2018-09-20 14:21:33,633 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 v_prenex_4))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.geq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul RNE .cse4 .cse5))) (fp.leq v_prenex_4 (fp.add RNE .cse0 .cse2)) (not (fp.lt .cse3 v_prenex_3)) (not (fp.leq v_prenex_4 .cse0)))))))) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.div RNE .cse6 main_~dd~0))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse7 .cse7))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11))) (and (not (fp.leq (fp.div RNE .cse6 .cse7) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse6)) (not (fp.lt .cse8 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse6 .cse9)) (fp.leq main_~dd~0 (fp.add RNE .cse6 .cse9)) (not (fp.gt .cse8 (fp.mul RNE .cse10 .cse11)))))))))) is different from false [2018-09-20 14:21:36,391 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 v_prenex_4))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.geq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul RNE .cse4 .cse5))) (fp.leq v_prenex_4 (fp.add RNE .cse0 .cse2)) (not (fp.lt .cse3 v_prenex_3)) (not (fp.leq v_prenex_4 .cse0)))))))) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.div RNE .cse6 main_~dd~0))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse7 .cse7))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11))) (and (not (fp.leq (fp.div RNE .cse6 .cse7) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse6)) (not (fp.lt .cse8 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse6 .cse9)) (fp.leq main_~dd~0 (fp.add RNE .cse6 .cse9)) (not (fp.gt .cse8 (fp.mul RNE .cse10 .cse11)))))))))) is different from true [2018-09-20 14:21:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:21:36,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:21:36,456 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:21:36,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 14:21:36,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-20 14:21:36,457 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-20 14:21:36,458 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=21, Unknown=15, NotChecked=144, Total=210 [2018-09-20 14:21:36,458 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-09-20 14:21:41,491 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (not (fp.leq |c_SqrtR_#in~Input| .cse0)))) is different from false [2018-09-20 14:21:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:21:55,712 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-09-20 14:21:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 14:21:55,714 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-20 14:21:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:21:55,723 INFO L225 Difference]: With dead ends: 64 [2018-09-20 14:21:55,724 INFO L226 Difference]: Without dead ends: 62 [2018-09-20 14:21:55,725 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=37, Invalid=29, Unknown=16, NotChecked=190, Total=272 [2018-09-20 14:21:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-20 14:21:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-09-20 14:21:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-20 14:21:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-09-20 14:21:55,766 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 22 [2018-09-20 14:21:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:21:55,766 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-09-20 14:21:55,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-20 14:21:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-09-20 14:21:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-20 14:21:55,770 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:21:55,770 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:21:55,771 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:21:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-09-20 14:21:55,771 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:21:55,771 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-09-20 14:21:55,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:22:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:22:07,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:22:10,374 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (and (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE c_SqrtR_~xnp1~0 .cse5))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse1 (fp.lt .cse2 (fp.neg .cse3))) (.cse0 (fp.gt .cse2 .cse3))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (not .cse0) (= (_ bv0 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse5) (= (fp.add RNE .cse5 (fp.div RNE (fp.mul RNE .cse5 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse5) .cse5))) .cse4)) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from false [2018-09-20 14:22:12,472 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (and (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE c_SqrtR_~xnp1~0 .cse5))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse1 (fp.lt .cse2 (fp.neg .cse3))) (.cse0 (fp.gt .cse2 .cse3))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (not .cse0) (= (_ bv0 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse5) (= (fp.add RNE .cse5 (fp.div RNE (fp.mul RNE .cse5 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse5) .cse5))) .cse4)) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-09-20 14:22:14,653 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 2.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.mul RNE .cse3 (fp.sub RNE c_SqrtR_~xnp1~0 .cse2))) (.cse1 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (not (fp.gt .cse0 .cse1)) (= (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2))) .cse3)) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)))) is different from false [2018-09-20 14:22:16,734 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 2.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.mul RNE .cse3 (fp.sub RNE c_SqrtR_~xnp1~0 .cse2))) (.cse1 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (not (fp.gt .cse0 .cse1)) (= (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2))) .cse3)) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)))) is different from true [2018-09-20 14:22:19,293 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (let ((.cse1 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0))) .cse4)))) (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse0))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse1 .cse1)))) (and (fp.leq |c_SqrtR_#in~Input| .cse0) (= |c_SqrtR_#res| (fp.div RNE .cse0 .cse1)) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))))) is different from false [2018-09-20 14:22:21,474 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (let ((.cse1 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0))) .cse4)))) (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse0))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse1 .cse1)))) (and (fp.leq |c_SqrtR_#in~Input| .cse0) (= |c_SqrtR_#res| (fp.div RNE .cse0 .cse1)) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))))) is different from true [2018-09-20 14:22:24,048 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (let ((.cse1 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE main_~dd~0 .cse0) .cse0))) .cse4)))) (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) (fp.add RNE .cse1 .cse1)))) (and (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse1)) (fp.leq main_~dd~0 .cse0) (not (fp.gt .cse2 .cse3)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0)))) (not (fp.lt .cse2 (fp.neg .cse3)))))))) is different from false [2018-09-20 14:22:26,532 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (let ((.cse1 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE main_~dd~0 .cse0) .cse0))) .cse4)))) (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) (fp.add RNE .cse1 .cse1)))) (and (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse1)) (fp.leq main_~dd~0 .cse0) (not (fp.gt .cse2 .cse3)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0)))) (not (fp.lt .cse2 (fp.neg .cse3)))))))) is different from true [2018-09-20 14:22:29,081 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (let ((.cse1 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.sub RNE ((_ to_fp 11 53) RNE (_ bv1 32)) (fp.mul RNE (fp.mul RNE main_~dd~0 .cse0) .cse0))) .cse4)))) (let ((.cse2 (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) (fp.add RNE .cse1 .cse1)))) (and (= c_main_~r~0 (fp.div RNE .cse0 .cse1)) (fp.leq main_~dd~0 .cse0) (not (fp.gt .cse2 .cse3)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0)))) (not (fp.lt .cse2 (fp.neg .cse3)))))))) is different from false [2018-09-20 14:22:29,897 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-09-20 14:22:30,099 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2018-09-20 14:22:30,101 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:810) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:732) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:338) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-09-20 14:22:30,112 INFO L168 Benchmark]: Toolchain (without parser) took 181184.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 953.2 MB in the beginning and 972.2 MB in the end (delta: -19.0 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2018-09-20 14:22:30,113 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:22:30,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.99 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-09-20 14:22:30,115 INFO L168 Benchmark]: Boogie Preprocessor took 45.78 ms. Allocated memory is still 1.0 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:22:30,115 INFO L168 Benchmark]: RCFGBuilder took 10374.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-09-20 14:22:30,118 INFO L168 Benchmark]: TraceAbstraction took 170458.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.2 MB in the end (delta: 115.9 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. [2018-09-20 14:22:30,123 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.99 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.78 ms. Allocated memory is still 1.0 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 10374.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 170458.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.2 MB in the end (delta: 115.9 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...