./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.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_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/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 c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ............................................................................................................................................................................................................................................ 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_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/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 c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:49:31,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:49:31,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:49:31,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:49:31,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:49:31,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:49:31,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:49:31,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:49:31,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:49:31,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:49:31,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:49:31,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:49:31,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:49:31,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:49:31,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:49:31,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:49:31,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:49:31,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:49:31,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:49:31,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:49:31,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:49:31,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:49:31,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:49:31,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:49:31,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:49:31,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:49:31,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:49:31,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:49:31,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:49:31,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:49:31,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:49:31,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:49:31,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:49:31,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:49:31,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:49:31,174 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:49:31,174 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:49:31,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:49:31,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:49:31,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:49:31,184 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:49:31,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:49:31,185 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:49:31,185 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:49:31,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:49:31,185 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:49:31,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:49:31,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:49:31,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:49:31,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:49:31,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:49:31,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:49:31,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:49:31,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:49:31,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:49:31,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:49:31,188 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:49:31,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:49:31,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:49:31,188 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_857d563c-79d5-4211-b91b-07a160d3cdc0/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 -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-11-10 12:49:31,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:49:31,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:49:31,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:49:31,226 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:49:31,227 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:49:31,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 12:49:31,263 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/497b1814b/bbf6809630f3437395f7c63a7c9fc9f6/FLAGe543ada68 [2018-11-10 12:49:31,664 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:49:31,664 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 12:49:31,668 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/497b1814b/bbf6809630f3437395f7c63a7c9fc9f6/FLAGe543ada68 [2018-11-10 12:49:31,677 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/497b1814b/bbf6809630f3437395f7c63a7c9fc9f6 [2018-11-10 12:49:31,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:49:31,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:49:31,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:31,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:49:31,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:49:31,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4897ecb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31, skipping insertion in model container [2018-11-10 12:49:31,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:49:31,701 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:49:31,797 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:31,800 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:49:31,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:31,818 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:49:31,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31 WrapperNode [2018-11-10 12:49:31,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:31,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:49:31,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:49:31,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:49:31,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... [2018-11-10 12:49:31,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:49:31,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:49:31,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:49:31,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:49:31,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:49:31,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:49:31,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:49:31,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:49:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:49:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:49:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:49:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:49:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:49:31,978 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:49:31,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:31 BoogieIcfgContainer [2018-11-10 12:49:31,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:49:31,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:49:31,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:49:31,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:49:31,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:49:31" (1/3) ... [2018-11-10 12:49:31,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d2e97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:31, skipping insertion in model container [2018-11-10 12:49:31,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:31" (2/3) ... [2018-11-10 12:49:31,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d2e97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:31, skipping insertion in model container [2018-11-10 12:49:31,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:31" (3/3) ... [2018-11-10 12:49:31,983 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 12:49:31,990 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:49:31,994 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:49:32,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:49:32,021 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:49:32,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:49:32,022 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:49:32,022 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:49:32,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:49:32,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:49:32,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:49:32,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:49:32,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:49:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-10 12:49:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:49:32,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:49:32,035 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:32,036 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:49:32,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-10 12:49:32,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:32,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:32,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:32,113 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:49:32,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:49:32 BoogieIcfgContainer [2018-11-10 12:49:32,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:49:32,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:49:32,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:49:32,126 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:49:32,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:31" (3/4) ... [2018-11-10 12:49:32,129 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:49:32,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:49:32,129 INFO L168 Benchmark]: Toolchain (without parser) took 450.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:32,130 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:32,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.04 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:32,131 INFO L168 Benchmark]: Boogie Preprocessor took 14.85 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:32,131 INFO L168 Benchmark]: RCFGBuilder took 144.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:32,132 INFO L168 Benchmark]: TraceAbstraction took 147.00 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:32,132 INFO L168 Benchmark]: Witness Printer took 2.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:49:32,134 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.04 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.85 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 144.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 147.00 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 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: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:49:33,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:49:33,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:49:33,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:49:33,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:49:33,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:49:33,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:49:33,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:49:33,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:49:33,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:49:33,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:49:33,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:49:33,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:49:33,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:49:33,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:49:33,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:49:33,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:49:33,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:49:33,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:49:33,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:49:33,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:49:33,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:49:33,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:49:33,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:49:33,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:49:33,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:49:33,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:49:33,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:49:33,562 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:49:33,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:49:33,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:49:33,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:49:33,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:49:33,564 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:49:33,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:49:33,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:49:33,565 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 12:49:33,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:49:33,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:49:33,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:49:33,576 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:49:33,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:49:33,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:49:33,577 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:49:33,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:49:33,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:49:33,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:49:33,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:49:33,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:49:33,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:49:33,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:49:33,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:49:33,579 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:49:33,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:49:33,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:49:33,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:49:33,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:49:33,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:49:33,579 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 12:49:33,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:49:33,580 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 12:49:33,580 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 12:49:33,580 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_857d563c-79d5-4211-b91b-07a160d3cdc0/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 -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-11-10 12:49:33,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:49:33,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:49:33,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:49:33,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:49:33,624 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:49:33,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 12:49:33,667 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/3598ea3f2/e07ab7cb8c3c45fd8aac839e05f61728/FLAG526e94996 [2018-11-10 12:49:34,055 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:49:34,055 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 12:49:34,059 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/3598ea3f2/e07ab7cb8c3c45fd8aac839e05f61728/FLAG526e94996 [2018-11-10 12:49:34,068 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/data/3598ea3f2/e07ab7cb8c3c45fd8aac839e05f61728 [2018-11-10 12:49:34,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:49:34,071 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:49:34,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:34,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:49:34,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:49:34,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26052e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34, skipping insertion in model container [2018-11-10 12:49:34,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:49:34,093 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:49:34,191 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:34,196 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:49:34,205 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:34,213 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:49:34,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34 WrapperNode [2018-11-10 12:49:34,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:34,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:49:34,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:49:34,215 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:49:34,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... [2018-11-10 12:49:34,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:49:34,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:49:34,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:49:34,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:49:34,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:49:34,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:49:34,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:49:34,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:49:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:49:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:49:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:49:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:49:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:49:36,570 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:49:36,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:36 BoogieIcfgContainer [2018-11-10 12:49:36,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:49:36,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:49:36,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:49:36,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:49:36,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:49:34" (1/3) ... [2018-11-10 12:49:36,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ff2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:36, skipping insertion in model container [2018-11-10 12:49:36,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:34" (2/3) ... [2018-11-10 12:49:36,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ff2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:36, skipping insertion in model container [2018-11-10 12:49:36,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:36" (3/3) ... [2018-11-10 12:49:36,576 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 12:49:36,582 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:49:36,586 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:49:36,595 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:49:36,612 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:49:36,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:49:36,613 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:49:36,613 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:49:36,613 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:49:36,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:49:36,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:49:36,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:49:36,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:49:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-10 12:49:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:49:36,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:49:36,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:36,633 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:49:36,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:36,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-10 12:49:36,639 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:49:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 12:49:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:36,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:42,654 WARN L179 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 12:49:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:42,662 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:49:42,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:42,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:42,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:49:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:42,687 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-10 12:49:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:47,197 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-10 12:49:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:47,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-10 12:49:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:49:47,406 INFO L225 Difference]: With dead ends: 22 [2018-11-10 12:49:47,407 INFO L226 Difference]: Without dead ends: 11 [2018-11-10 12:49:47,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-11-10 12:49:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 12:49:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 12:49:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-10 12:49:47,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-10 12:49:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:49:47,437 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-10 12:49:47,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:49:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-10 12:49:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 12:49:47,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:49:47,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:47,438 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:49:47,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-11-10 12:49:47,438 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:49:47,438 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 12:49:47,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:47,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:56,039 WARN L179 SmtUtils]: Spent 6.48 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 12:49:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:56,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:49:59,593 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 12:50:01,790 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-10 12:50:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-10 12:50:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:50:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 12:50:01,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:50:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:50:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-11-10 12:50:01,815 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-11-10 12:50:07,843 WARN L179 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-11-10 12:50:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:16,876 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-10 12:50:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:50:16,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-10 12:50:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:16,877 INFO L225 Difference]: With dead ends: 15 [2018-11-10 12:50:16,877 INFO L226 Difference]: Without dead ends: 12 [2018-11-10 12:50:16,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=14, Invalid=18, Unknown=2, NotChecked=8, Total=42 [2018-11-10 12:50:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-10 12:50:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-10 12:50:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:50:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-10 12:50:16,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-10 12:50:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:16,881 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-10 12:50:16,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:50:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-10 12:50:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 12:50:16,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:16,882 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:16,882 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-11-10 12:50:16,882 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:50:16,882 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-10 12:50:16,886 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 12:50:17,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:50:17,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:50:17,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:50:30,086 WARN L179 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 12:50:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:30,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:50:37,528 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from true [2018-11-10 12:50:39,925 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 12:50:42,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 12:50:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-10 12:50:42,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:50:42,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-10 12:50:42,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:50:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:50:42,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=27, Unknown=7, NotChecked=22, Total=72 [2018-11-10 12:50:42,352 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-11-10 12:50:44,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (let ((.cse2 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (or (fp.eq .cse2 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse2) .cse0)) .cse2)))))) is different from true [2018-11-10 12:50:46,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 12:50:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:49,487 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-10 12:50:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:50:49,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-10 12:50:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:49,488 INFO L225 Difference]: With dead ends: 16 [2018-11-10 12:50:49,488 INFO L226 Difference]: Without dead ends: 13 [2018-11-10 12:50:49,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=20, Invalid=29, Unknown=9, NotChecked=52, Total=110 [2018-11-10 12:50:49,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-10 12:50:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 12:50:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 12:50:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-10 12:50:49,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-10 12:50:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:49,492 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-10 12:50:49,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:50:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-10 12:50:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 12:50:49,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:49,492 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:49,493 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:49,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-11-10 12:50:49,493 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:50:49,493 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/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-11-10 12:50:49,497 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 12:50:50,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 12:50:50,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:50:50,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:02,250 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 12:51:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:02,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:51:33,407 WARN L179 SmtUtils]: Spent 10.27 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-10 12:51:35,847 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 12:51:38,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 12:51:40,894 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 12:51:43,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 12:51:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-10 12:51:43,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:43,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-10 12:51:43,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:51:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:51:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=45, Unknown=11, NotChecked=30, Total=110 [2018-11-10 12:51:43,526 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-11-10 12:51:46,195 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (let ((.cse2 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse2) .cse0)) .cse2)) (fp.eq .cse2 .cse1))))) is different from true [2018-11-10 12:51:48,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse0)) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse2)))) (or (fp.eq .cse1 .cse0) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse2)) .cse1)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse2))) .cse2)) c_main_~main__x1~0))) is different from true [2018-11-10 12:51:56,644 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (and (not (= c_main_~__VERIFIER_assert__cond~0 (_ bv0 32))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse0)) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 .cse0)))) is different from false [2018-11-10 12:51:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:59,878 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-10 12:51:59,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:51:59,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-10 12:51:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:59,879 INFO L225 Difference]: With dead ends: 19 [2018-11-10 12:51:59,879 INFO L226 Difference]: Without dead ends: 15 [2018-11-10 12:51:59,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=30, Invalid=48, Unknown=14, NotChecked=90, Total=182 [2018-11-10 12:51:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-10 12:51:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 12:51:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 12:51:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 12:51:59,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-10 12:51:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:59,883 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-10 12:51:59,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:51:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 12:51:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:51:59,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:59,884 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:59,884 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:59,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 4 times [2018-11-10 12:51:59,884 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:51:59,884 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/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-11-10 12:51:59,889 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:52:01,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:52:01,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:52:01,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:52:13,786 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 12:52:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:52:13,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:52:18,243 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 12:52:20,459 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-10 12:52:22,895 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:52:25,338 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:52:28,000 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:52:30,661 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:52:33,489 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:52:36,321 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:52:39,347 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:52:42,463 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:52:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-11-10 12:52:42,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:52:42,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-10 12:52:42,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 12:52:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 12:52:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=53, Unknown=13, NotChecked=90, Total=182 [2018-11-10 12:52:42,504 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-11-10 12:52:45,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 12:52:48,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 12:52:51,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 12:52:53,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 12:52:55,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 12:53:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:53:00,963 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-10 12:53:00,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:53:00,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-10 12:53:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:53:00,964 INFO L225 Difference]: With dead ends: 19 [2018-11-10 12:53:00,965 INFO L226 Difference]: Without dead ends: 16 [2018-11-10 12:53:00,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=36, Invalid=58, Unknown=18, NotChecked=230, Total=342 [2018-11-10 12:53:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-10 12:53:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 12:53:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 12:53:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-10 12:53:00,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-10 12:53:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:53:00,971 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-10 12:53:00,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 12:53:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-10 12:53:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:53:00,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:53:00,972 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:53:00,972 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:53:00,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:53:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 5 times [2018-11-10 12:53:00,972 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:53:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/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-11-10 12:53:00,975 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-10 12:53:02,861 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 12:53:02,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:53:02,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:53:05,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-11-10 12:53:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-10 12:53:05,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:53:07,506 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 12:53:11,149 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:53:13,582 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:53:16,253 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:53:18,926 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:53:21,803 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:53:24,674 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:53:27,757 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:53:30,867 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:53:34,147 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 12:53:37,460 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 12:53:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-11-10 12:53:37,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:53:37,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-10 12:53:37,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 12:53:37,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 12:53:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=59, Unknown=12, NotChecked=140, Total=240 [2018-11-10 12:53:37,508 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-11-10 12:53:40,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 12:53:43,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 12:53:46,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 12:53:49,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 12:53:51,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 12:53:58,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-11-10 12:54:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:01,314 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-10 12:54:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:54:01,315 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-11-10 12:54:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:01,315 INFO L225 Difference]: With dead ends: 20 [2018-11-10 12:54:01,315 INFO L226 Difference]: Without dead ends: 17 [2018-11-10 12:54:01,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=41, Invalid=65, Unknown=18, NotChecked=338, Total=462 [2018-11-10 12:54:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-10 12:54:01,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 12:54:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 12:54:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-10 12:54:01,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-10 12:54:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:01,322 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-10 12:54:01,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 12:54:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-10 12:54:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 12:54:01,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:01,322 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:01,322 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:01,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 6 times [2018-11-10 12:54:01,323 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 12:54:01,323 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_857d563c-79d5-4211-b91b-07a160d3cdc0/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-11-10 12:54:01,326 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-10 12:54:03,381 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-10 12:54:03,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:54:03,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:05,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-11-10 12:54:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-10 12:54:05,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:08,108 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-11-10 12:54:11,515 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 12:54:13,964 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 12:54:16,640 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 12:54:19,314 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 12:54:22,204 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 12:54:25,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 12:54:28,230 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 12:54:31,331 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 12:54:34,679 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 12:54:38,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 12:54:40,286 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 12:54:40,487 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2018-11-10 12:54:40,488 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java: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:823) 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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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) ... 40 more [2018-11-10 12:54:40,490 INFO L168 Benchmark]: Toolchain (without parser) took 306419.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 949.7 MB in the beginning and 897.0 MB in the end (delta: 52.7 MB). Peak memory consumption was 180.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:40,491 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:54:40,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.29 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:40,491 INFO L168 Benchmark]: Boogie Preprocessor took 20.11 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:54:40,492 INFO L168 Benchmark]: RCFGBuilder took 2335.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:40,492 INFO L168 Benchmark]: TraceAbstraction took 303918.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.0 MB in the end (delta: 206.0 MB). Peak memory consumption was 206.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:40,495 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.13 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 142.29 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.11 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2335.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 303918.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.0 MB in the end (delta: 206.0 MB). Peak memory consumption was 206.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...