./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer --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 97ac2503801a101f5a44ae44e4a77e81fa872959 ............................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer --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 97ac2503801a101f5a44ae44e4a77e81fa872959 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:52:42,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:52:42,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:52:42,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:52:42,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:52:42,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:52:42,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:52:42,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:52:42,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:52:42,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:52:42,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:52:42,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:52:42,805 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:52:42,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:52:42,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:52:42,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:52:42,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:52:42,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:52:42,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:52:42,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:52:42,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:52:42,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:52:42,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:52:42,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:52:42,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:52:42,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:52:42,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:52:42,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:52:42,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:52:42,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:52:42,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:52:42,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:52:42,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:52:42,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:52:42,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:52:42,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:52:42,827 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 03:52:42,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:52:42,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:52:42,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:52:42,841 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:52:42,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:52:42,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:52:42,842 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:52:42,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:52:42,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:52:42,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:52:42,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:52:42,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:52:42,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:52:42,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:52:42,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:52:42,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:52:42,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:52:42,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:52:42,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:52:42,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:52:42,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:52:42,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:52:42,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:52:42,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:52:42,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:52:42,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:52:42,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:52:42,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:52:42,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:52:42,848 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer 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 -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-11-10 03:52:42,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:52:42,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:52:42,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:52:42,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:52:42,891 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:52:42,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-10 03:52:42,936 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/577919a55/81d0877b05e145b8859fd4c224590748/FLAGceb833d47 [2018-11-10 03:52:43,290 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:52:43,291 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-10 03:52:43,296 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/577919a55/81d0877b05e145b8859fd4c224590748/FLAGceb833d47 [2018-11-10 03:52:43,306 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/577919a55/81d0877b05e145b8859fd4c224590748 [2018-11-10 03:52:43,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:52:43,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:52:43,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:52:43,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:52:43,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:52:43,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae94ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43, skipping insertion in model container [2018-11-10 03:52:43,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:52:43,339 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:52:43,468 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:52:43,471 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:52:43,489 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:52:43,504 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:52:43,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43 WrapperNode [2018-11-10 03:52:43,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:52:43,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:52:43,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:52:43,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:52:43,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... [2018-11-10 03:52:43,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:52:43,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:52:43,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:52:43,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:52:43,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/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-11-10 03:52:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:52:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:52:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:52:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:52:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-10 03:52:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 03:52:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure InvSqrt [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:52:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-10 03:52:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 03:52:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:52:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:52:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-11-10 03:52:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 03:52:43,825 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:52:43,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:43 BoogieIcfgContainer [2018-11-10 03:52:43,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:52:43,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:52:43,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:52:43,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:52:43,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:52:43" (1/3) ... [2018-11-10 03:52:43,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083913a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:52:43, skipping insertion in model container [2018-11-10 03:52:43,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:43" (2/3) ... [2018-11-10 03:52:43,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083913a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:52:43, skipping insertion in model container [2018-11-10 03:52:43,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:43" (3/3) ... [2018-11-10 03:52:43,834 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-10 03:52:43,844 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:52:43,851 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:52:43,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:52:43,900 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:52:43,901 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:52:43,901 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:52:43,901 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:52:43,901 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:52:43,902 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:52:43,902 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:52:43,902 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:52:43,902 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:52:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 03:52:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 03:52:43,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:43,927 INFO L375 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, 1] [2018-11-10 03:52:43,929 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:52:43,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 57370181, now seen corresponding path program 1 times [2018-11-10 03:52:43,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:43,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:43,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:52:44,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:44,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:44,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:52:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:52:44,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:52:44,129 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2018-11-10 03:52:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:44,171 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 03:52:44,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:52:44,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 03:52:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:44,181 INFO L225 Difference]: With dead ends: 45 [2018-11-10 03:52:44,181 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 03:52:44,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:52:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 03:52:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 03:52:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 03:52:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 03:52:44,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-10 03:52:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:44,216 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-10 03:52:44,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:52:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-10 03:52:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 03:52:44,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:44,217 INFO L375 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, 1] [2018-11-10 03:52:44,217 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:52:44,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:44,218 INFO L82 PathProgramCache]: Analyzing trace with hash 76287466, now seen corresponding path program 1 times [2018-11-10 03:52:44,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:44,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:44,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:44,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:44,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:52:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:52:44,277 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 03:52:44,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:52:44 BoogieIcfgContainer [2018-11-10 03:52:44,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:52:44,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:52:44,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:52:44,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:52:44,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:43" (3/4) ... [2018-11-10 03:52:44,313 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:52:44,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:52:44,314 INFO L168 Benchmark]: Toolchain (without parser) took 1004.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:44,315 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:52:44,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:44,316 INFO L168 Benchmark]: Boogie Preprocessor took 37.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:44,316 INFO L168 Benchmark]: RCFGBuilder took 283.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:44,317 INFO L168 Benchmark]: TraceAbstraction took 482.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:44,317 INFO L168 Benchmark]: Witness Printer took 3.53 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-11-10 03:52:44,320 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 283.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 482.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 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: 54]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L12] float __return_72; [L13] int __return_87; VAL [\old(__return_72)=1597463012, \old(__return_87)=1597463009, \old(__return_main)=1597463011, __return_72=0, __return_87=0, __return_main=0] [L16] float main__a; [L17] float main__r; [L18] main__a = __VERIFIER_nondet_float() [L19] int main____CPAchecker_TMP_0; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=1597463015] [L20] COND TRUE main__a >= 0.10000000149011612 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=1597463015] [L22] COND TRUE main__a <= 100.0 [L24] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main____CPAchecker_TMP_0=1, main__a=1597463015] [L25] COND TRUE main____CPAchecker_TMP_0 != 0 [L28] float __tmp_1; [L29] __tmp_1 = main__a [L30] float InvSqrt__x; [L31] InvSqrt__x = __tmp_1 [L32] float InvSqrt__xhalf = 0.5 * InvSqrt__x; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__x=1597463015, main____CPAchecker_TMP_0=1, main__a=1597463015] [L33] FCALL union float_int InvSqrt__i; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463015, main____CPAchecker_TMP_0=1, main__a=1597463015] [L34] FCALL InvSqrt__i.f = InvSqrt__x VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463015, main____CPAchecker_TMP_0=1, main__a=1597463015] [L35] EXPR, FCALL InvSqrt__i.i VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__i.i=0, InvSqrt__x=1597463015, main____CPAchecker_TMP_0=1, main__a=1597463015] [L35] FCALL InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__i.i=0, InvSqrt__x=1597463015, main____CPAchecker_TMP_0=1, main__a=1597463015] [L36] EXPR, FCALL InvSqrt__i.f VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__i.f=1597463015, InvSqrt__x=1597463015, main____CPAchecker_TMP_0=1, main__a=1597463015] [L36] InvSqrt__x = InvSqrt__i.f [L37] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L38] __return_72 = InvSqrt__x [L39] main__r = __return_72 [L40] int main____CPAchecker_TMP_1; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=1597463013, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463013, main____CPAchecker_TMP_0=1, main__a=1597463015, main__r=1597463013] [L41] COND FALSE !(main__r >= 0.0) VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=1597463013, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463013, main____CPAchecker_TMP_0=1, main__a=1597463015, main__r=1597463013] [L67] main____CPAchecker_TMP_1 = 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=1597463013, __return_87=0, __return_main=0, __tmp_1=1597463015, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463013, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=1597463015, main__r=1597463013] [L48] int __tmp_2; [L49] __tmp_2 = main____CPAchecker_TMP_1 [L50] int __VERIFIER_assert__cond; [L51] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=1597463013, __return_87=0, __return_main=0, __tmp_1=1597463015, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463013, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=1597463015, main__r=1597463013] [L52] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=1597463013, __return_87=0, __return_main=0, __tmp_1=1597463015, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463013, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=1597463015, main__r=1597463013] [L54] __VERIFIER_error() VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=1597463013, __return_87=0, __return_main=0, __tmp_1=1597463015, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={1597463010:0}, InvSqrt__x=1597463013, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=1597463015, main__r=1597463013] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 9 SDslu, 65 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 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-1dbac8b [2018-11-10 03:52:45,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:52:45,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:52:45,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:52:45,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:52:45,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:52:45,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:52:45,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:52:45,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:52:45,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:52:45,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:52:45,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:52:45,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:52:46,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:52:46,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:52:46,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:52:46,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:52:46,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:52:46,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:52:46,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:52:46,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:52:46,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:52:46,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:52:46,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:52:46,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:52:46,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:52:46,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:52:46,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:52:46,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:52:46,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:52:46,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:52:46,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:52:46,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:52:46,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:52:46,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:52:46,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:52:46,020 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 03:52:46,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:52:46,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:52:46,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:52:46,035 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:52:46,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:52:46,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:52:46,036 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:52:46,036 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:52:46,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:52:46,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:52:46,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:52:46,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:52:46,037 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:52:46,037 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:52:46,037 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 03:52:46,037 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 03:52:46,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:52:46,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:52:46,039 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:52:46,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:52:46,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:52:46,039 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:52:46,039 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:52:46,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 03:52:46,040 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 03:52:46,040 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer 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 -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-11-10 03:52:46,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:52:46,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:52:46,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:52:46,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:52:46,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:52:46,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-10 03:52:46,131 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/3da2508b4/6e0b03c96f2a424088fb26a294cc49a5/FLAG6afc3dcd5 [2018-11-10 03:52:46,489 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:52:46,490 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-10 03:52:46,494 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/3da2508b4/6e0b03c96f2a424088fb26a294cc49a5/FLAG6afc3dcd5 [2018-11-10 03:52:46,504 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/data/3da2508b4/6e0b03c96f2a424088fb26a294cc49a5 [2018-11-10 03:52:46,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:52:46,507 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:52:46,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:52:46,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:52:46,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:52:46,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3871e03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46, skipping insertion in model container [2018-11-10 03:52:46,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:52:46,545 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:52:46,697 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:52:46,701 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:52:46,722 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:52:46,743 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:52:46,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46 WrapperNode [2018-11-10 03:52:46,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:52:46,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:52:46,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:52:46,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:52:46,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... [2018-11-10 03:52:46,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:52:46,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:52:46,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:52:46,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:52:46,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/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-11-10 03:52:46,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:52:46,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:52:46,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure InvSqrt [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:52:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-11-10 03:52:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 03:52:48,462 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 03:52:51,006 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:52:51,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:51 BoogieIcfgContainer [2018-11-10 03:52:51,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:52:51,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:52:51,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:52:51,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:52:51,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:52:46" (1/3) ... [2018-11-10 03:52:51,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178fb751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:52:51, skipping insertion in model container [2018-11-10 03:52:51,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:46" (2/3) ... [2018-11-10 03:52:51,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178fb751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:52:51, skipping insertion in model container [2018-11-10 03:52:51,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:51" (3/3) ... [2018-11-10 03:52:51,012 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-10 03:52:51,019 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:52:51,025 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:52:51,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:52:51,059 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:52:51,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:52:51,060 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:52:51,060 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:52:51,060 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:52:51,060 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:52:51,060 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:52:51,060 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:52:51,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:52:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 03:52:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 03:52:51,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:51,081 INFO L375 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, 1] [2018-11-10 03:52:51,083 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:52:51,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 57370181, now seen corresponding path program 1 times [2018-11-10 03:52:51,091 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:52:51,091 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/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-11-10 03:52:51,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:51,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:52:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:52:51,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:52:51,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:51,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:51,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:52:51,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:52:51,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:52:51,817 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2018-11-10 03:52:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:54,132 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 03:52:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:52:54,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 03:52:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:54,141 INFO L225 Difference]: With dead ends: 45 [2018-11-10 03:52:54,141 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 03:52:54,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:52:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 03:52:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 03:52:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 03:52:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 03:52:54,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-10 03:52:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:54,177 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-10 03:52:54,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:52:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-10 03:52:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 03:52:54,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:54,178 INFO L375 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, 1] [2018-11-10 03:52:54,178 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:52:54,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 76287466, now seen corresponding path program 1 times [2018-11-10 03:52:54,179 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:52:54,179 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 03:52:54,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:56,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:52:57,026 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-10 03:52:57,628 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-10 03:53:11,392 WARN L179 SmtUtils]: Spent 6.96 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-10 03:53:14,298 INFO L303 Elim1Store]: Index analysis took 2885 ms [2018-11-10 03:53:14,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:53:16,150 INFO L303 Elim1Store]: Index analysis took 1845 ms [2018-11-10 03:53:16,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:53:16,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:53:17,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:53:29,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:53:29,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:81 [2018-11-10 03:53:54,157 WARN L179 SmtUtils]: Spent 10.48 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 03:53:56,186 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_main_~#InvSqrt__i~0.base|) |c_main_~#InvSqrt__i~0.offset|))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= |c_main_#t~mem1| .cse1) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0) (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0))))) is different from false [2018-11-10 03:53:58,906 INFO L303 Elim1Store]: Index analysis took 2054 ms [2018-11-10 03:53:58,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-11-10 03:54:00,812 INFO L303 Elim1Store]: Index analysis took 1903 ms [2018-11-10 03:54:00,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 56 [2018-11-10 03:54:00,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:12,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:25,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:25,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:100, output treesize:56 [2018-11-10 03:54:27,714 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= (_ bv1597463007 32) (bvadd (bvashr v_arrayElimCell_3 (_ bv1 32)) (select (select |c_#memory_int| |c_main_~#InvSqrt__i~0.base|) |c_main_~#InvSqrt__i~0.offset|))) (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0)))) is different from false [2018-11-10 03:54:29,324 INFO L303 Elim1Store]: Index analysis took 1510 ms [2018-11-10 03:54:29,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-10 03:54:31,408 INFO L303 Elim1Store]: Index analysis took 2081 ms [2018-11-10 03:54:31,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-11-10 03:54:31,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:35,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:47,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:47,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:69 [2018-11-10 03:55:06,172 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 03:55:08,202 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~InvSqrt__x~0 (let ((.cse1 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0)))) is different from false [2018-11-10 03:55:10,408 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (= c_main_~main__r~0 ((_ to_fp 8 24) RNE (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse0) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.geq .cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 100.0))))) is different from false [2018-11-10 03:55:12,535 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (= c_main_~main__r~0 ((_ to_fp 8 24) RNE (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse0) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.geq .cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 100.0))))) is different from true [2018-11-10 03:55:18,936 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (not (fp.geq ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse0) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (_ +zero 11 53))) (fp.geq .cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 100.0))))) is different from false [2018-11-10 03:55:21,084 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (not (fp.geq ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse0) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (_ +zero 11 53))) (fp.geq .cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 100.0))))) is different from true [2018-11-10 03:55:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:33,886 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:55:33,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:55:33,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 03:55:33,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:55:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:55:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=23, Unknown=17, NotChecked=70, Total=132 [2018-11-10 03:55:33,909 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 12 states. [2018-11-10 03:55:44,979 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE c_main_~main__a~0)) (.cse1 ((_ to_fp 11 53) RNE 100.0)) (.cse3 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (.cse0 ((_ to_fp 11 53) RNE c_main_~InvSqrt__x~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1) (fp.geq .cse0 .cse3) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0))) is different from false [2018-11-10 03:55:47,018 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE c_main_~main__a~0)) (.cse1 ((_ to_fp 11 53) RNE 100.0)) (.cse3 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (.cse0 ((_ to_fp 11 53) RNE c_main_~InvSqrt__x~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1) (fp.geq .cse0 .cse3) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0))) is different from true [2018-11-10 03:55:52,532 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (.cse2 ((_ to_fp 11 53) RNE c_main_~InvSqrt__x~0)) (.cse4 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse0 ((_ to_fp 11 53) RNE (let ((.cse5 (select (select |c_#memory_int| |c_main_~#InvSqrt__i~0.base|) |c_main_~#InvSqrt__i~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (.cse3 ((_ to_fp 11 53) RNE 100.0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1) (= ((_ to_fp 8 24) RNE (fp.mul RNE .cse4 .cse2)) c_main_~InvSqrt__xhalf~0) (= ((_ to_fp 8 24) RNE (fp.mul RNE .cse4 .cse0)) c_main_~InvSqrt__xhalf~0) (fp.leq .cse0 .cse3))) is different from false [2018-11-10 03:55:54,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (.cse2 ((_ to_fp 11 53) RNE c_main_~InvSqrt__x~0)) (.cse4 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse0 ((_ to_fp 11 53) RNE (let ((.cse5 (select (select |c_#memory_int| |c_main_~#InvSqrt__i~0.base|) |c_main_~#InvSqrt__i~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (.cse3 ((_ to_fp 11 53) RNE 100.0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1) (= ((_ to_fp 8 24) RNE (fp.mul RNE .cse4 .cse2)) c_main_~InvSqrt__xhalf~0) (= ((_ to_fp 8 24) RNE (fp.mul RNE .cse4 .cse0)) c_main_~InvSqrt__xhalf~0) (fp.leq .cse0 .cse3))) is different from true [2018-11-10 03:55:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:55:56,691 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-11-10 03:55:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:55:56,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-10 03:55:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:55:56,728 INFO L225 Difference]: With dead ends: 30 [2018-11-10 03:55:56,728 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 03:55:56,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 82.0s TimeCoverageRelationStatistics Valid=26, Invalid=23, Unknown=21, NotChecked=112, Total=182 [2018-11-10 03:55:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 03:55:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 03:55:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 03:55:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2018-11-10 03:55:56,734 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 23 [2018-11-10 03:55:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:55:56,734 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2018-11-10 03:55:56,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:55:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2018-11-10 03:55:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 03:55:56,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:55:56,736 INFO L375 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, 1, 1] [2018-11-10 03:55:56,736 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:55:56,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1790865783, now seen corresponding path program 1 times [2018-11-10 03:55:56,737 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:55:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_893bd155-526a-4035-95bd-58e01cb516b2/bin-2019/uautomizer/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-11-10 03:55:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,278 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-10 03:55:59,162 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-10 03:56:01,194 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~InvSqrt__x~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0))) is different from false [2018-11-10 03:56:05,019 INFO L303 Elim1Store]: Index analysis took 2265 ms [2018-11-10 03:56:05,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:56:07,115 INFO L303 Elim1Store]: Index analysis took 2094 ms [2018-11-10 03:56:07,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:56:07,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:56:09,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:56:17,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:56:17,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:81 [2018-11-10 03:56:19,873 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (let ((.cse1 (select (select |c_#memory_int| |c_main_~#InvSqrt__i~0.base|) |c_main_~#InvSqrt__i~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0) (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)))) is different from false [2018-11-10 03:56:24,310 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_main_~#InvSqrt__i~0.base|) |c_main_~#InvSqrt__i~0.offset|))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= |c_main_#t~mem1| .cse1) (= ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) c_main_~InvSqrt__xhalf~0) (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0))))) is different from true [2018-11-10 03:56:26,392 INFO L303 Elim1Store]: Index analysis took 2078 ms [2018-11-10 03:56:26,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-11-10 03:56:30,415 INFO L303 Elim1Store]: Index analysis took 4019 ms [2018-11-10 03:56:30,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 56 [2018-11-10 03:56:30,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:56:43,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:56:58,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:56:58,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:100, output treesize:56 [2018-11-10 03:57:10,611 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 03:57:12,702 INFO L303 Elim1Store]: Index analysis took 2084 ms [2018-11-10 03:57:12,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-10 03:57:14,275 INFO L303 Elim1Store]: Index analysis took 1569 ms [2018-11-10 03:57:14,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-11-10 03:57:14,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:57:16,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:57:29,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:57:29,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:69 [2018-11-10 03:57:47,686 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 03:58:11,232 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 03:58:13,370 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) RNE (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse1) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from false [2018-11-10 03:58:15,488 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) RNE (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse1) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from true [2018-11-10 03:58:17,643 WARN L832 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) RNE c_main_~main__r~0) (_ +zero 11 53)) (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) RNE (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse1) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))))))) is different from false [2018-11-10 03:58:24,180 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (let ((.cse1 ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse2) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (not (fp.leq .cse1 ((_ to_fp 11 53) RNE 10.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2018-11-10 03:58:26,309 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (let ((.cse1 ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse2) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 100.0)) (not (fp.leq .cse1 ((_ to_fp 11 53) RNE 10.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))))))) is different from true [2018-11-10 03:58:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:39,222 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:58:39,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:58:39,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 03:58:39,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:58:39,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:58:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=16, Unknown=26, NotChecked=90, Total=156 [2018-11-10 03:58:39,238 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 13 states. [2018-11-10 03:59:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:12,781 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-10 03:59:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:59:12,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-11-10 03:59:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:12,910 INFO L225 Difference]: With dead ends: 25 [2018-11-10 03:59:12,910 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:59:12,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.6s TimeCoverageRelationStatistics Valid=24, Invalid=16, Unknown=26, NotChecked=90, Total=156 [2018-11-10 03:59:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:59:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:59:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:59:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:59:12,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-10 03:59:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:12,912 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:59:12,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:59:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:59:12,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:59:12,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:59:27,251 WARN L179 SmtUtils]: Spent 14.30 s on a formula simplification that was a NOOP. DAG size: 74 [2018-11-10 03:59:46,302 WARN L179 SmtUtils]: Spent 19.05 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-10 03:59:46,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:59:46,304 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:59:46,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:59:46,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:59:46,304 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 03:59:46,304 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:59:46,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:59:46,304 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-10 03:59:46,304 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L33-5(line 33) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 80) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 91) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 61) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-10 03:59:46,305 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 91) no Hoare annotation was computed. [2018-11-10 03:59:46,306 INFO L421 ceAbstractionStarter]: At program point L73(lines 41 74) the Hoare annotation is: (or (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (not (fp.geq ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse0) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (_ +zero 11 53))) (fp.geq .cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 100.0))))) (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse3 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (let ((.cse4 ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse5) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse3)) .cse5) .cse5))))))))) (and (fp.leq .cse3 ((_ to_fp 11 53) RNE 100.0)) (not (fp.leq .cse4 ((_ to_fp 11 53) RNE 10.0))) (fp.geq .cse4 (_ +zero 11 53)) (fp.geq .cse3 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0)))))))) [2018-11-10 03:59:46,306 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-10 03:59:46,306 INFO L425 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-11-10 03:59:46,306 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 03:59:46,307 INFO L425 ceAbstractionStarter]: For program point L36-2(line 36) no Hoare annotation was computed. [2018-11-10 03:59:46,307 INFO L425 ceAbstractionStarter]: For program point L36-3(line 36) no Hoare annotation was computed. [2018-11-10 03:59:46,307 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 91) the Hoare annotation is: true [2018-11-10 03:59:46,307 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 85) no Hoare annotation was computed. [2018-11-10 03:59:46,307 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 90) no Hoare annotation was computed. [2018-11-10 03:59:46,307 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 69) no Hoare annotation was computed. [2018-11-10 03:59:46,307 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 74) no Hoare annotation was computed. [2018-11-10 03:59:46,308 INFO L421 ceAbstractionStarter]: At program point L68(lines 43 69) the Hoare annotation is: (or (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))))) (and (not (fp.geq ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr v_arrayElimCell_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse0) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (_ +zero 11 53))) (fp.geq .cse1 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) RNE 100.0))))) (exists ((v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse3 ((_ to_fp 11 53) RNE (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) (let ((.cse4 ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr v_arrayElimCell_7 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul RNE ((_ to_fp 11 53) RNE .cse5) (fp.sub RNE ((_ to_fp 11 53) RNE (/ 3.0 2.0)) ((_ to_fp 11 53) RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 8 24) RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) .cse3)) .cse5) .cse5))))))))) (and (fp.leq .cse3 ((_ to_fp 11 53) RNE 100.0)) (not (fp.leq .cse4 ((_ to_fp 11 53) RNE 10.0))) (fp.geq .cse4 (_ +zero 11 53)) (fp.geq .cse3 ((_ to_fp 11 53) RNE (/ 2500000037252903.0 25000000000000000.0))))))) (= (_ bv1 32) main_~main____CPAchecker_TMP_1~0)) [2018-11-10 03:59:46,308 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-10 03:59:46,308 INFO L425 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. [2018-11-10 03:59:46,312 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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) [2018-11-10 03:59:46,314 INFO L168 Benchmark]: Toolchain (without parser) took 419806.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 949.7 MB in the beginning and 953.0 MB in the end (delta: -3.3 MB). Peak memory consumption was 132.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:46,314 INFO L168 Benchmark]: CDTParser took 0.14 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-11-10 03:59:46,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.62 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:46,315 INFO L168 Benchmark]: Boogie Preprocessor took 37.26 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:59:46,316 INFO L168 Benchmark]: RCFGBuilder took 4225.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:46,316 INFO L168 Benchmark]: TraceAbstraction took 415305.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 953.0 MB in the end (delta: 150.9 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:46,319 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.14 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 235.62 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.26 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4225.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 415305.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 953.0 MB in the end (delta: 150.9 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...