./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+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_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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 2efbbd8e1ed6cd606263edae3254601484469bf9 .......................................................................................................................................................................................................................................................................................................................................................... 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_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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 2efbbd8e1ed6cd606263edae3254601484469bf9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:26:14,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:26:14,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:26:14,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:26:14,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:26:14,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:26:14,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:26:14,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:26:14,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:26:14,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:26:14,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:26:14,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:26:14,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:26:14,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:26:14,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:26:14,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:26:14,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:26:14,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:26:14,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:26:14,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:26:14,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:26:14,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:26:14,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:26:14,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:26:14,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:26:14,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:26:14,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:26:14,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:26:14,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:26:14,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:26:14,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:26:14,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:26:14,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:26:14,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:26:14,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:26:14,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:26:14,213 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 21:26:14,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:26:14,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:26:14,225 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:26:14,225 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:26:14,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:26:14,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:26:14,226 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:26:14,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:26:14,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:26:14,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:26:14,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:26:14,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:26:14,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:26:14,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:26:14,227 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:26:14,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:26:14,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:26:14,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:26:14,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:26:14,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:26:14,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:26:14,229 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:26:14,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:26:14,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:26:14,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:26:14,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:26:14,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:26:14,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:26:14,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:26:14,231 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_74738638-5440-4ed2-8863-ad980df817e7/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-10-26 21:26:14,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:26:14,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:26:14,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:26:14,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:26:14,277 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:26:14,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-10-26 21:26:14,333 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/3b04abae6/43b267e21603447495a3e045f1ccd6ce/FLAGdece8ce42 [2018-10-26 21:26:14,735 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:26:14,736 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-10-26 21:26:14,742 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/3b04abae6/43b267e21603447495a3e045f1ccd6ce/FLAGdece8ce42 [2018-10-26 21:26:14,756 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/3b04abae6/43b267e21603447495a3e045f1ccd6ce [2018-10-26 21:26:14,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:26:14,762 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:26:14,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:26:14,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:26:14,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:26:14,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:26:14" (1/1) ... [2018-10-26 21:26:14,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40893eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:14, skipping insertion in model container [2018-10-26 21:26:14,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:26:14" (1/1) ... [2018-10-26 21:26:14,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:26:14,806 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:26:14,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:26:14,976 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:26:15,001 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:26:15,015 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:26:15,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15 WrapperNode [2018-10-26 21:26:15,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:26:15,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:26:15,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:26:15,017 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:26:15,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... [2018-10-26 21:26:15,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:26:15,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:26:15,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:26:15,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:26:15,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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-10-26 21:26:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:26:15,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:26:15,210 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:26:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:26:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:26:15,603 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:26:15,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:26:15 BoogieIcfgContainer [2018-10-26 21:26:15,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:26:15,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:26:15,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:26:15,607 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:26:15,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:26:14" (1/3) ... [2018-10-26 21:26:15,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1cb38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:26:15, skipping insertion in model container [2018-10-26 21:26:15,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:15" (2/3) ... [2018-10-26 21:26:15,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1cb38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:26:15, skipping insertion in model container [2018-10-26 21:26:15,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:26:15" (3/3) ... [2018-10-26 21:26:15,611 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-10-26 21:26:15,620 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:26:15,628 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:26:15,643 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:26:15,669 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:26:15,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:26:15,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:26:15,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:26:15,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:26:15,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:26:15,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:26:15,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:26:15,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:26:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-26 21:26:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 21:26:15,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:26:15,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:26:15,699 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:26:15,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:26:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-10-26 21:26:15,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:26:15,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:26:15,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:26:15,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:26:15,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:26:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:26:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:26:15,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:26:15,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:26:15,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:26:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:26:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:26:15,959 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-10-26 21:26:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:26:16,058 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-10-26 21:26:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:26:16,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-26 21:26:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:26:16,069 INFO L225 Difference]: With dead ends: 75 [2018-10-26 21:26:16,069 INFO L226 Difference]: Without dead ends: 46 [2018-10-26 21:26:16,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:26:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-26 21:26:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-10-26 21:26:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-26 21:26:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-10-26 21:26:16,111 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-10-26 21:26:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:26:16,111 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-10-26 21:26:16,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:26:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-10-26 21:26:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 21:26:16,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:26:16,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:26:16,113 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:26:16,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:26:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-10-26 21:26:16,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:26:16,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:26:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:26:16,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:26:16,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:26:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:26:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:26:16,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:26:16,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:26:16,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:26:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:26:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:26:16,186 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-10-26 21:26:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:26:16,272 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-10-26 21:26:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:26:16,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-26 21:26:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:26:16,274 INFO L225 Difference]: With dead ends: 50 [2018-10-26 21:26:16,274 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 21:26:16,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-26 21:26:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 21:26:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-10-26 21:26:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-26 21:26:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-10-26 21:26:16,281 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-10-26 21:26:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:26:16,281 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-10-26 21:26:16,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:26:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-10-26 21:26:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 21:26:16,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:26:16,282 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:26:16,283 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:26:16,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:26:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-10-26 21:26:16,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:26:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:26:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:26:16,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:26:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:26:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:26:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:26:16,320 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 21:26:16,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:26:16 BoogieIcfgContainer [2018-10-26 21:26:16,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:26:16,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:26:16,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:26:16,348 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:26:16,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:26:15" (3/4) ... [2018-10-26 21:26:16,353 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 21:26:16,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:26:16,354 INFO L168 Benchmark]: Toolchain (without parser) took 1591.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:26:16,355 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:26:16,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.09 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:26:16,356 INFO L168 Benchmark]: Boogie Preprocessor took 33.55 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:26:16,357 INFO L168 Benchmark]: RCFGBuilder took 552.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:26:16,358 INFO L168 Benchmark]: TraceAbstraction took 743.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:26:16,358 INFO L168 Benchmark]: Witness Printer took 4.89 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-10-26 21:26:16,361 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.09 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.55 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 552.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 743.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 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: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 2 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-10-26 21:26:18,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:26:18,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:26:18,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:26:18,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:26:18,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:26:18,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:26:18,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:26:18,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:26:18,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:26:18,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:26:18,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:26:18,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:26:18,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:26:18,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:26:18,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:26:18,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:26:18,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:26:18,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:26:18,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:26:18,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:26:18,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:26:18,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:26:18,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:26:18,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:26:18,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:26:18,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:26:18,509 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:26:18,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:26:18,511 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:26:18,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:26:18,512 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:26:18,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:26:18,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:26:18,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:26:18,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:26:18,515 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-10-26 21:26:18,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:26:18,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:26:18,529 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:26:18,529 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:26:18,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:26:18,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:26:18,530 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:26:18,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:26:18,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:26:18,530 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:26:18,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:26:18,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:26:18,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:26:18,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:26:18,533 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 21:26:18,533 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 21:26:18,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:26:18,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:26:18,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:26:18,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:26:18,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:26:18,534 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:26:18,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:26:18,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:26:18,534 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:26:18,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:26:18,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:26:18,535 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-26 21:26:18,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:26:18,535 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 21:26:18,535 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 21:26:18,535 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_74738638-5440-4ed2-8863-ad980df817e7/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-10-26 21:26:18,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:26:18,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:26:18,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:26:18,590 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:26:18,591 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:26:18,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-10-26 21:26:18,652 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/710b9a37c/9f931eb104b042319c09cb359f6dc089/FLAGe005b9b9d [2018-10-26 21:26:19,048 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:26:19,048 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-10-26 21:26:19,056 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/710b9a37c/9f931eb104b042319c09cb359f6dc089/FLAGe005b9b9d [2018-10-26 21:26:19,071 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/data/710b9a37c/9f931eb104b042319c09cb359f6dc089 [2018-10-26 21:26:19,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:26:19,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:26:19,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:26:19,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:26:19,081 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:26:19,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd77459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19, skipping insertion in model container [2018-10-26 21:26:19,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:26:19,125 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:26:19,331 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:26:19,338 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:26:19,380 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:26:19,404 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:26:19,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19 WrapperNode [2018-10-26 21:26:19,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:26:19,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:26:19,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:26:19,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:26:19,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... [2018-10-26 21:26:19,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:26:19,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:26:19,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:26:19,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:26:19,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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-10-26 21:26:19,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:26:19,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:26:19,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:26:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:26:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:26:28,391 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:26:28,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:26:28 BoogieIcfgContainer [2018-10-26 21:26:28,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:26:28,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:26:28,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:26:28,397 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:26:28,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:26:19" (1/3) ... [2018-10-26 21:26:28,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fb672c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:26:28, skipping insertion in model container [2018-10-26 21:26:28,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:26:19" (2/3) ... [2018-10-26 21:26:28,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fb672c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:26:28, skipping insertion in model container [2018-10-26 21:26:28,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:26:28" (3/3) ... [2018-10-26 21:26:28,402 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-10-26 21:26:28,413 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:26:28,421 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:26:28,439 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:26:28,464 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:26:28,465 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:26:28,465 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:26:28,465 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:26:28,465 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:26:28,466 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:26:28,466 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:26:28,466 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:26:28,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:26:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-26 21:26:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 21:26:28,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:26:28,492 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:26:28,494 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:26:28,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:26:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-10-26 21:26:28,502 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:26:28,503 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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-10-26 21:26:28,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:26:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:26:30,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:26:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:26:30,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:26:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:26:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:26:30,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:26:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:26:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:26:30,977 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-10-26 21:26:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:26:36,446 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-10-26 21:26:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:26:36,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-26 21:26:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:26:36,459 INFO L225 Difference]: With dead ends: 70 [2018-10-26 21:26:36,459 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 21:26:36,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:26:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 21:26:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-10-26 21:26:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-26 21:26:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-10-26 21:26:36,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-10-26 21:26:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:26:36,504 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-10-26 21:26:36,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:26:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-10-26 21:26:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 21:26:36,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:26:36,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:26:36,505 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:26:36,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:26:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-10-26 21:26:36,506 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:26:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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-10-26 21:26:36,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:26:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:26:38,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:26:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:26:38,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:26:38,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:26:38,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:26:38,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:26:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:26:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:26:38,148 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-10-26 21:26:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:26:44,682 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-10-26 21:26:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:26:44,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-26 21:26:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:26:44,684 INFO L225 Difference]: With dead ends: 48 [2018-10-26 21:26:44,684 INFO L226 Difference]: Without dead ends: 29 [2018-10-26 21:26:44,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-10-26 21:26:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-26 21:26:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-26 21:26:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-26 21:26:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-10-26 21:26:44,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-10-26 21:26:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:26:44,693 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-10-26 21:26:44,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:26:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-10-26 21:26:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 21:26:44,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:26:44,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:26:44,695 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:26:44,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:26:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-10-26 21:26:44,697 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:26:44,697 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/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-10-26 21:26:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:26:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:26:46,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:26:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:26:46,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:26:46,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:26:46,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:26:46,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:26:46,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:26:46,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:26:46,322 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-10-26 21:27:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:27:05,452 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-10-26 21:27:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:27:05,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-26 21:27:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:27:05,455 INFO L225 Difference]: With dead ends: 55 [2018-10-26 21:27:05,455 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 21:27:05,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:27:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 21:27:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-26 21:27:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-26 21:27:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-10-26 21:27:05,464 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-10-26 21:27:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:27:05,464 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-10-26 21:27:05,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:27:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-10-26 21:27:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:27:05,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:27:05,465 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] [2018-10-26 21:27:05,466 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:27:05,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:27:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-10-26 21:27:05,467 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:27:05,467 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-10-26 21:27:05,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:27:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:27:09,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:27:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:27:09,688 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:27:09,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:27:09,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:27:09,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:27:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:27:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:27:09,740 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-10-26 21:27:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:27:13,704 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-10-26 21:27:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:27:13,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-26 21:27:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:27:13,705 INFO L225 Difference]: With dead ends: 54 [2018-10-26 21:27:13,706 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:27:13,706 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-10-26 21:27:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:27:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-10-26 21:27:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 21:27:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-10-26 21:27:13,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-10-26 21:27:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:27:13,714 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-10-26 21:27:13,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:27:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-10-26 21:27:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:27:13,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:27:13,716 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] [2018-10-26 21:27:13,716 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:27:13,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:27:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-10-26 21:27:13,717 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:27:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-10-26 21:27:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:27:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:27:17,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:27:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:27:17,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:27:20,188 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-10-26 21:27:22,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from true [2018-10-26 21:27:25,068 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-10-26 21:27:27,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-10-26 21:27:30,032 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-10-26 21:27:32,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-10-26 21:27:34,971 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-10-26 21:27:37,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-10-26 21:27:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-26 21:27:37,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:27:37,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-26 21:27:37,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:27:37,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:27:37,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=41, Unknown=8, NotChecked=60, Total=132 [2018-10-26 21:27:37,536 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-10-26 21:27:40,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0))) is different from true [2018-10-26 21:27:42,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= .cse0 c_main_~SqrtR__Input~0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0))) is different from true [2018-10-26 21:27:45,090 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= .cse0 c_main_~SqrtR__Input~0) (= .cse0 c_main_~SqrtR__xn~0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0))) is different from true [2018-10-26 21:28:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:18,900 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-10-26 21:28:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:28:19,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-26 21:28:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:19,247 INFO L225 Difference]: With dead ends: 101 [2018-10-26 21:28:19,247 INFO L226 Difference]: Without dead ends: 78 [2018-10-26 21:28:19,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=34, Invalid=55, Unknown=11, NotChecked=140, Total=240 [2018-10-26 21:28:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-26 21:28:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-10-26 21:28:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 21:28:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-10-26 21:28:19,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-10-26 21:28:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:19,262 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-10-26 21:28:19,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:28:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-10-26 21:28:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 21:28:19,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:19,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:19,265 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:19,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-10-26 21:28:19,266 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:28:19,266 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-10-26 21:28:19,270 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 21:28:25,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 21:28:25,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:28:26,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:28:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:28:28,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:28:30,676 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-10-26 21:28:34,847 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-10-26 21:28:37,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-10-26 21:28:40,324 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-10-26 21:28:43,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-10-26 21:28:45,880 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-10-26 21:28:48,571 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-10-26 21:28:51,251 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-10-26 21:28:53,946 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-10-26 21:28:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-10-26 21:28:54,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:28:54,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-10-26 21:28:54,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:28:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:28:54,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=42, Unknown=9, NotChecked=80, Total=156 [2018-10-26 21:28:54,038 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 13 states. [2018-10-26 21:28:56,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0))) is different from true [2018-10-26 21:28:59,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-10-26 21:29:02,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0) (= .cse0 c_main_~SqrtR__xn~0))) is different from true [2018-10-26 21:29:05,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 ((_ to_fp 11 53) RNE 3.0)) (.cse4 ((_ to_fp 11 53) RNE 8.0)) (.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse0 .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0) .cse0))))) .cse4) c_main_~SqrtR__xnp1~0) (= .cse0 c_main_~SqrtR__Input~0) (= .cse0 c_main_~SqrtR__xn~0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse3 c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0))) is different from true [2018-10-26 21:29:13,304 WARN L179 SmtUtils]: Spent 7.26 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-26 21:29:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:46,479 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2018-10-26 21:29:46,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:29:46,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-10-26 21:29:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:46,572 INFO L225 Difference]: With dead ends: 115 [2018-10-26 21:29:46,573 INFO L226 Difference]: Without dead ends: 92 [2018-10-26 21:29:46,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=46, Invalid=67, Unknown=13, NotChecked=216, Total=342 [2018-10-26 21:29:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-26 21:29:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2018-10-26 21:29:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:29:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-10-26 21:29:46,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 26 [2018-10-26 21:29:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:46,589 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-10-26 21:29:46,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:29:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-10-26 21:29:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 21:29:46,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:46,591 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:29:46,591 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:46,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1739969516, now seen corresponding path program 1 times [2018-10-26 21:29:46,594 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:29:46,594 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-10-26 21:29:46,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:29:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:53,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:29:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:29:53,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:29:53,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:29:53,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:29:53,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:29:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:29:53,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:29:53,715 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 7 states. [2018-10-26 21:30:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:09,356 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2018-10-26 21:30:09,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:30:09,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-26 21:30:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:09,358 INFO L225 Difference]: With dead ends: 83 [2018-10-26 21:30:09,359 INFO L226 Difference]: Without dead ends: 55 [2018-10-26 21:30:09,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:30:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-26 21:30:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2018-10-26 21:30:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:30:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-10-26 21:30:09,375 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 26 [2018-10-26 21:30:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:09,376 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-10-26 21:30:09,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:30:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2018-10-26 21:30:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:30:09,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:09,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:09,378 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:09,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1580885751, now seen corresponding path program 1 times [2018-10-26 21:30:09,378 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:30:09,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-10-26 21:30:09,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:16,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:30:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:30:16,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:30:16,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:16,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:30:16,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:30:16,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:30:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:30:16,539 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 7 states. [2018-10-26 21:30:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:36,260 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-10-26 21:30:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:30:36,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-10-26 21:30:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:36,262 INFO L225 Difference]: With dead ends: 80 [2018-10-26 21:30:36,262 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:30:36,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:30:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:30:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-10-26 21:30:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 21:30:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-10-26 21:30:36,276 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 27 [2018-10-26 21:30:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:36,277 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2018-10-26 21:30:36,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:30:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-10-26 21:30:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 21:30:36,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:36,278 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:36,278 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:36,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-10-26 21:30:36,278 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:30:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-10-26 21:30:36,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:43,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:30:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:30:43,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:30:45,367 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-10-26 21:30:47,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-10-26 21:30:49,925 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-10-26 21:30:52,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-10-26 21:30:54,827 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-10-26 21:30:57,267 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-10-26 21:30:59,684 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32)))))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-10-26 21:31:02,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32)))))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-10-26 21:31:04,152 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse2 (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))))))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-10-26 21:31:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-10-26 21:31:04,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:31:04,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-26 21:31:04,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:31:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:31:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=53, Unknown=9, NotChecked=90, Total=182 [2018-10-26 21:31:04,428 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 14 states. [2018-10-26 21:31:08,252 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse1 (let ((.cse2 (fp.div RNE .cse0 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32)))))) (fp.add RNE .cse2 .cse2)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse1) (fp.mul RNE c_~_EPS~0 .cse1))))) is different from true [2018-10-26 21:31:23,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div RNE .cse2 c_main_~main__d~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~main__d~0))) is different from true [2018-10-26 21:31:26,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.add RNE .cse0 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~SqrtR__Input~0) (let ((.cse1 (let ((.cse2 (fp.div RNE .cse0 c_main_~SqrtR__Input~0))) (fp.add RNE .cse2 .cse2)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse1) (fp.mul RNE c_~_EPS~0 .cse1))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-10-26 21:31:28,203 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add RNE c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse1 (fp.add RNE .cse1 ((_ to_fp 11 53) RNE (_ bv1 32))))) c_main_~SqrtR__xn~0)) is different from true [2018-10-26 21:32:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:32:03,677 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2018-10-26 21:32:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:32:03,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-26 21:32:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:32:03,681 INFO L225 Difference]: With dead ends: 104 [2018-10-26 21:32:03,681 INFO L226 Difference]: Without dead ends: 81 [2018-10-26 21:32:03,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=38, Invalid=57, Unknown=13, NotChecked=198, Total=306 [2018-10-26 21:32:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-26 21:32:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2018-10-26 21:32:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 21:32:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2018-10-26 21:32:03,710 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 33 [2018-10-26 21:32:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:32:03,711 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2018-10-26 21:32:03,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:32:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-10-26 21:32:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 21:32:03,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:32:03,714 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:32:03,714 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:32:03,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:32:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-10-26 21:32:03,716 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:32:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-10-26 21:32:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:32:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:09,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:32:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:32:09,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:32:11,766 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 21:32:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:32:11,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:32:11,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 21:32:11,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:32:11,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:32:11,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:32:11,837 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 8 states. [2018-10-26 21:32:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:32:28,970 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2018-10-26 21:32:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:32:28,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-26 21:32:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:32:28,983 INFO L225 Difference]: With dead ends: 127 [2018-10-26 21:32:28,983 INFO L226 Difference]: Without dead ends: 104 [2018-10-26 21:32:28,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:32:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-26 21:32:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2018-10-26 21:32:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 21:32:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2018-10-26 21:32:29,006 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 33 [2018-10-26 21:32:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:32:29,007 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2018-10-26 21:32:29,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:32:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-10-26 21:32:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:32:29,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:32:29,010 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:32:29,011 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:32:29,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:32:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1112505107, now seen corresponding path program 1 times [2018-10-26 21:32:29,011 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:32:29,011 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-10-26 21:32:29,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:32:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:38,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:32:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:32:38,456 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:32:38,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:32:38,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:32:38,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:32:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:32:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:32:38,560 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 4 states. [2018-10-26 21:32:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:32:50,852 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2018-10-26 21:32:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:32:51,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 21:32:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:32:51,209 INFO L225 Difference]: With dead ends: 111 [2018-10-26 21:32:51,210 INFO L226 Difference]: Without dead ends: 69 [2018-10-26 21:32:51,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-10-26 21:32:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-26 21:32:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-10-26 21:32:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 21:32:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-10-26 21:32:51,231 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 37 [2018-10-26 21:32:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:32:51,232 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-10-26 21:32:51,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:32:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-10-26 21:32:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:32:51,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:32:51,234 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:32:51,234 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:32:51,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:32:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-10-26 21:32:51,234 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:32:51,235 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-10-26 21:32:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:00,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:09,682 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 21:33:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:33:09,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:12,210 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 c_main_~SqrtR__xn~0)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))) is different from false [2018-10-26 21:33:14,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 c_main_~SqrtR__xn~0)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))) is different from true [2018-10-26 21:33:17,304 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from false [2018-10-26 21:33:20,018 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from true [2018-10-26 21:33:22,773 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from false [2018-10-26 21:33:25,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from true [2018-10-26 21:33:28,305 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32))))) (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) .cse2))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse2 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))))) is different from false [2018-10-26 21:33:31,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32))))) (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) .cse2))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse2 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))))) is different from true [2018-10-26 21:33:33,096 WARN L179 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-26 21:33:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-10-26 21:33:33,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:33:33,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-26 21:33:33,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:33:33,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:33:33,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=61, Unknown=9, NotChecked=76, Total=182 [2018-10-26 21:33:33,229 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-10-26 21:33:43,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (let ((.cse3 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32))))) (let ((.cse2 (fp.div RNE .cse0 .cse3))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse3 .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse3) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse1 .cse2)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse1 .cse1)))))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-10-26 21:33:45,887 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse1 (fp.div RNE .cse2 c_main_~main__d~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~main__d~0))) is different from true [2018-10-26 21:33:48,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse1 (fp.div RNE .cse2 c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) (= (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~SqrtR__Input~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-10-26 21:33:51,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.add RNE .cse0 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~SqrtR__Input~0) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse1 c_main_~SqrtR__xn~0)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse1 .cse1)))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0))) is different from true [2018-10-26 21:34:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:43,908 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2018-10-26 21:34:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:34:43,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-10-26 21:34:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:43,912 INFO L225 Difference]: With dead ends: 108 [2018-10-26 21:34:43,912 INFO L226 Difference]: Without dead ends: 83 [2018-10-26 21:34:43,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=44, Invalid=65, Unknown=13, NotChecked=184, Total=306 [2018-10-26 21:34:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-26 21:34:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2018-10-26 21:34:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-26 21:34:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-10-26 21:34:43,944 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 37 [2018-10-26 21:34:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:43,944 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-10-26 21:34:43,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:34:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-10-26 21:34:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:34:43,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:43,945 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:43,946 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:43,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2041929248, now seen corresponding path program 1 times [2018-10-26 21:34:43,946 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:34:43,946 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-10-26 21:34:43,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:53,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:34:53,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:34:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:34:53,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:34:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:34:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:34:53,659 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 4 states. [2018-10-26 21:35:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:02,922 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-10-26 21:35:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:35:03,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 21:35:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:03,295 INFO L225 Difference]: With dead ends: 80 [2018-10-26 21:35:03,296 INFO L226 Difference]: Without dead ends: 55 [2018-10-26 21:35:03,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-10-26 21:35:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-26 21:35:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-26 21:35:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-26 21:35:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-10-26 21:35:03,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 37 [2018-10-26 21:35:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:03,317 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-10-26 21:35:03,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:35:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-10-26 21:35:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 21:35:03,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:03,318 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:03,319 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:03,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 716182498, now seen corresponding path program 2 times [2018-10-26 21:35:03,319 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 21:35:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74738638-5440-4ed2-8863-ad980df817e7/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-10-26 21:35:03,329 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 21:35:16,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 21:35:16,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:35:17,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:35:23,948 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 21:35:26,278 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2018-10-26 21:35:26,279 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-10-26 21:35:26,282 INFO L168 Benchmark]: Toolchain (without parser) took 547208.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 954.6 MB in the beginning and 968.2 MB in the end (delta: -13.6 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:35:26,290 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:35:26,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.82 ms. Allocated memory is still 1.0 GB. Free memory was 954.6 MB in the beginning and 938.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:35:26,291 INFO L168 Benchmark]: Boogie Preprocessor took 35.64 ms. Allocated memory is still 1.0 GB. Free memory is still 938.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:35:26,291 INFO L168 Benchmark]: RCFGBuilder took 8950.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 938.5 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:35:26,292 INFO L168 Benchmark]: TraceAbstraction took 537889.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 172.0 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:35:26,295 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.82 ms. Allocated memory is still 1.0 GB. Free memory was 954.6 MB in the beginning and 938.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.64 ms. Allocated memory is still 1.0 GB. Free memory is still 938.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8950.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 938.5 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 537889.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 172.0 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...