./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_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/config/TaipanReach.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_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan --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 Taipan --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_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/config/TaipanReach.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_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan --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 Taipan --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-10-26 19:13:51,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:13:51,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:13:51,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:13:51,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:13:51,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:13:51,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:13:51,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:13:51,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:13:51,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:13:51,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:13:51,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:13:51,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:13:51,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:13:51,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:13:51,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:13:51,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:13:51,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:13:51,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:13:51,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:13:51,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:13:51,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:13:51,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:13:51,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:13:51,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:13:51,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:13:51,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:13:51,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:13:51,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:13:51,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:13:51,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:13:51,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:13:51,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:13:51,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:13:51,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:13:51,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:13:51,878 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:13:51,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:13:51,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:13:51,898 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:13:51,898 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:13:51,899 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:13:51,899 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:13:51,899 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:13:51,899 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:13:51,899 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:13:51,899 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:13:51,900 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:13:51,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:13:51,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:13:51,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:13:51,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:13:51,902 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:13:51,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:13:51,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:13:51,906 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:13:51,907 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:13:51,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:13:51,907 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:13:51,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:13:51,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:13:51,909 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:13:51,909 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:13:51,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:13:51,909 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:13:51,910 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan 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 -> Taipan 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-10-26 19:13:51,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:13:51,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:13:51,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:13:51,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:13:51,956 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:13:51,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-10-26 19:13:52,009 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/c8570889e/822782b2e9e44001a3112376e97007f6/FLAGd4dabe06f [2018-10-26 19:13:52,382 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:13:52,383 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-10-26 19:13:52,389 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/c8570889e/822782b2e9e44001a3112376e97007f6/FLAGd4dabe06f [2018-10-26 19:13:52,403 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/c8570889e/822782b2e9e44001a3112376e97007f6 [2018-10-26 19:13:52,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:13:52,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:13:52,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:13:52,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:13:52,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:13:52,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406eea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52, skipping insertion in model container [2018-10-26 19:13:52,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:13:52,434 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:13:52,566 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:13:52,569 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:13:52,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:13:52,593 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:13:52,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52 WrapperNode [2018-10-26 19:13:52,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:13:52,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:13:52,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:13:52,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:13:52,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:13:52,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:13:52,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:13:52,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:13:52,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... [2018-10-26 19:13:52,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:13:52,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:13:52,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:13:52,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:13:52,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:13:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:13:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:13:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:13:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:13:52,992 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:13:52,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:52 BoogieIcfgContainer [2018-10-26 19:13:52,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:13:52,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:13:52,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:13:52,997 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:13:52,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:13:52" (1/3) ... [2018-10-26 19:13:52,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7079d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:13:52, skipping insertion in model container [2018-10-26 19:13:52,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:52" (2/3) ... [2018-10-26 19:13:52,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7079d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:13:52, skipping insertion in model container [2018-10-26 19:13:52,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:52" (3/3) ... [2018-10-26 19:13:53,000 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-10-26 19:13:53,009 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:13:53,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:13:53,032 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:13:53,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:13:53,064 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:13:53,064 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:13:53,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:13:53,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:13:53,064 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:13:53,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:13:53,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:13:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-26 19:13:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 19:13:53,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:53,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:53,090 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:53,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-10-26 19:13:53,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:13:53,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:53,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:53,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:13:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:13:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:13:53,212 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 19:13:53,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:13:53 BoogieIcfgContainer [2018-10-26 19:13:53,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:13:53,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:13:53,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:13:53,245 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:13:53,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:52" (3/4) ... [2018-10-26 19:13:53,252 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 19:13:53,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:13:53,253 INFO L168 Benchmark]: Toolchain (without parser) took 846.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 961.8 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:13:53,256 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:13:53,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.01 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:13:53,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.09 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:13:53,258 INFO L168 Benchmark]: Boogie Preprocessor took 18.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 948.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:13:53,258 INFO L168 Benchmark]: RCFGBuilder took 359.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:13:53,259 INFO L168 Benchmark]: TraceAbstraction took 250.20 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: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:13:53,260 INFO L168 Benchmark]: Witness Printer took 7.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:13:53,266 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.01 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.09 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 948.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 250.20 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: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.74 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-10-26 19:13:55,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:13:55,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:13:55,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:13:55,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:13:55,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:13:55,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:13:55,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:13:55,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:13:55,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:13:55,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:13:55,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:13:55,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:13:55,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:13:55,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:13:55,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:13:55,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:13:55,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:13:55,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:13:55,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:13:55,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:13:55,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:13:55,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:13:55,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:13:55,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:13:55,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:13:55,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:13:55,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:13:55,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:13:55,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:13:55,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:13:55,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:13:55,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:13:55,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:13:55,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:13:55,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:13:55,393 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 19:13:55,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:13:55,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:13:55,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:13:55,406 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:13:55,406 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:13:55,407 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:13:55,407 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:13:55,407 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:13:55,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:13:55,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:13:55,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:13:55,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:13:55,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:13:55,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:13:55,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:13:55,409 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 19:13:55,409 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 19:13:55,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:13:55,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:13:55,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:13:55,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:13:55,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:13:55,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:13:55,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:13:55,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:13:55,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:13:55,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:13:55,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:13:55,413 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 19:13:55,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:13:55,413 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 19:13:55,413 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 19:13:55,413 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_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan 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 -> Taipan 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-10-26 19:13:55,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:13:55,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:13:55,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:13:55,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:13:55,464 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:13:55,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-10-26 19:13:55,509 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/6ecb452b3/5813a27928fa42ba8bf3dc93d20d1d51/FLAGf8dee6953 [2018-10-26 19:13:55,904 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:13:55,904 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-10-26 19:13:55,911 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/6ecb452b3/5813a27928fa42ba8bf3dc93d20d1d51/FLAGf8dee6953 [2018-10-26 19:13:55,925 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/data/6ecb452b3/5813a27928fa42ba8bf3dc93d20d1d51 [2018-10-26 19:13:55,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:13:55,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:13:55,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:13:55,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:13:55,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:13:55,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:13:55" (1/1) ... [2018-10-26 19:13:55,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51511e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:55, skipping insertion in model container [2018-10-26 19:13:55,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:13:55" (1/1) ... [2018-10-26 19:13:55,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:13:55,977 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:13:56,144 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:13:56,151 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:13:56,167 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:13:56,181 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:13:56,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56 WrapperNode [2018-10-26 19:13:56,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:13:56,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:13:56,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:13:56,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:13:56,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:13:56,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:13:56,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:13:56,210 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:13:56,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... [2018-10-26 19:13:56,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:13:56,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:13:56,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:13:56,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:13:56,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:13:56,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:13:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:13:56,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:13:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:13:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:13:56,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:13:58,747 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:13:58,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:58 BoogieIcfgContainer [2018-10-26 19:13:58,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:13:58,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:13:58,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:13:58,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:13:58,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:13:55" (1/3) ... [2018-10-26 19:13:58,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff66e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:13:58, skipping insertion in model container [2018-10-26 19:13:58,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:13:56" (2/3) ... [2018-10-26 19:13:58,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff66e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:13:58, skipping insertion in model container [2018-10-26 19:13:58,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:58" (3/3) ... [2018-10-26 19:13:58,762 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-10-26 19:13:58,785 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:13:58,794 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:13:58,812 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:13:58,845 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:13:58,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:13:58,846 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:13:58,846 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:13:58,846 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:13:58,847 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:13:58,847 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:13:58,847 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:13:58,847 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:13:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-26 19:13:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 19:13:58,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:58,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:58,873 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:58,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-10-26 19:13:58,884 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:13:58,885 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-10-26 19:13:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:59,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:14:01,522 WARN L854 $PredicateComparison]: unable to prove that (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-10-26 19:14:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:01,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:14:01,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:01,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:14:01,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:14:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:14:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-26 19:14:01,565 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-26 19:14:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:01,595 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-10-26 19:14:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:14:01,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-26 19:14:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:01,609 INFO L225 Difference]: With dead ends: 22 [2018-10-26 19:14:01,611 INFO L226 Difference]: Without dead ends: 11 [2018-10-26 19:14:01,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-26 19:14:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-26 19:14:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-26 19:14:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-26 19:14:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-26 19:14:01,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-26 19:14:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:01,656 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-26 19:14:01,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:14:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-26 19:14:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 19:14:01,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:01,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:14:01,657 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:01,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-10-26 19:14:01,662 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:14:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-10-26 19:14:01,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:02,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:14:04,539 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 ((_ to_fp 11 53) RNE 1.0))) .cse0)) 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))) is different from true [2018-10-26 19:14:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-26 19:14:04,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:14:06,839 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-10-26 19:14:09,060 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-10-26 19:14:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-26 19:14:09,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:14:09,108 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:14:09,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-10-26 19:14:21,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:14:21,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-26 19:14:21,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:14:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:14:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=8, Unknown=3, NotChecked=10, Total=30 [2018-10-26 19:14:21,602 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-26 19:14:24,684 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-10-26 19:14:29,426 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__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))) is different from true [2018-10-26 19:14:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:30,534 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-26 19:14:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:14:30,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-26 19:14:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:30,536 INFO L225 Difference]: With dead ends: 15 [2018-10-26 19:14:30,537 INFO L226 Difference]: Without dead ends: 12 [2018-10-26 19:14:30,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56 [2018-10-26 19:14:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-26 19:14:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-26 19:14:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-26 19:14:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-26 19:14:30,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-26 19:14:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:30,542 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-26 19:14:30,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:14:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-26 19:14:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-26 19:14:30,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:30,544 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:14:30,544 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:30,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-10-26 19:14:30,545 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:14:30,545 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-10-26 19:14:30,558 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 19:14:31,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:14:31,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:14:31,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:14:33,767 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 ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))))) is different from true [2018-10-26 19:14:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-26 19:14:33,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:14:36,172 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-10-26 19:14:40,471 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-10-26 19:14:42,916 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-10-26 19:14:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-10-26 19:14:42,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:14:42,950 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:14:42,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 19:14:57,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:14:57,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 19:14:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:14:58,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-26 19:14:58,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:14:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:14:58,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=30, Total=72 [2018-10-26 19:14:58,425 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-10-26 19:15:00,924 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-10-26 19:15:03,174 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-10-26 19:15:05,439 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 ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 19:15:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:15:06,414 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-26 19:15:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:15:06,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-26 19:15:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:15:06,416 INFO L225 Difference]: With dead ends: 16 [2018-10-26 19:15:06,416 INFO L226 Difference]: Without dead ends: 13 [2018-10-26 19:15:06,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=21, Invalid=26, Unknown=7, NotChecked=78, Total=132 [2018-10-26 19:15:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-26 19:15:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-26 19:15:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-26 19:15:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-26 19:15:06,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-26 19:15:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:15:06,422 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-26 19:15:06,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:15:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-26 19:15:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 19:15:06,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:15:06,423 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:15:06,423 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:15:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:15:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-10-26 19:15:06,429 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:15:06,429 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-10-26 19:15:06,434 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 19:15:07,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 19:15:07,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:15:07,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:15:19,998 WARN L179 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 19:15:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:15:20,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:15:26,862 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-10-26 19:15:29,132 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-10-26 19:15:31,641 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-10-26 19:15:34,126 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-10-26 19:15:36,842 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-10-26 19:15:39,566 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-10-26 19:15:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-10-26 19:15:39,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:15:39,632 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:15:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 19:16:06,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 19:16:06,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 19:16:07,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:16:07,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-10-26 19:16:07,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:16:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:16:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=9, NotChecked=42, Total=110 [2018-10-26 19:16:07,440 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-10-26 19:16:10,285 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-10-26 19:16:12,851 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (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)))) (= ((_ 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-10-26 19:16:15,121 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) (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)))))) is different from true [2018-10-26 19:16:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:16:23,772 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-26 19:16:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:16:23,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-10-26 19:16:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:16:23,784 INFO L225 Difference]: With dead ends: 17 [2018-10-26 19:16:23,785 INFO L226 Difference]: Without dead ends: 14 [2018-10-26 19:16:23,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=26, Invalid=42, Unknown=12, NotChecked=102, Total=182 [2018-10-26 19:16:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-26 19:16:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-26 19:16:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-26 19:16:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-26 19:16:23,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-26 19:16:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:16:23,790 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-26 19:16:23,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:16:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-26 19:16:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 19:16:23,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:16:23,792 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:16:23,793 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:16:23,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:16:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-10-26 19:16:23,793 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:16:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-10-26 19:16:23,798 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 19:16:25,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 19:16:25,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:16:25,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:16:41,956 WARN L179 SmtUtils]: Spent 6.30 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 19:16:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:16:41,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:16:46,537 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-10-26 19:16:48,778 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-10-26 19:16:51,265 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-10-26 19:16:53,771 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-10-26 19:16:56,572 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-10-26 19:16:59,413 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-10-26 19:17:02,439 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-10-26 19:17:05,414 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-10-26 19:17:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-10-26 19:17:05,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:17:05,450 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:17:05,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 19:17:29,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 19:17:29,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Forcibly destroying the process [2018-10-26 19:17:30,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:17:30,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-26 19:17:30,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 19:17:30,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 19:17:30,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=38, Unknown=12, NotChecked=60, Total=132 [2018-10-26 19:17:30,733 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-10-26 19:17:33,776 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 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-10-26 19:17:36,545 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 ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 19:17:39,055 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 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-10-26 19:17:41,336 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 ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 19:17:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:17:52,223 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-26 19:17:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:17:52,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-10-26 19:17:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:17:52,224 INFO L225 Difference]: With dead ends: 18 [2018-10-26 19:17:52,225 INFO L226 Difference]: Without dead ends: 15 [2018-10-26 19:17:52,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=16, NotChecked=152, Total=240 [2018-10-26 19:17:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-26 19:17:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-26 19:17:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-26 19:17:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-26 19:17:52,233 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-26 19:17:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:17:52,233 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-26 19:17:52,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 19:17:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-26 19:17:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 19:17:52,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:17:52,234 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:17:52,236 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:17:52,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:17:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-10-26 19:17:52,237 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:17:52,237 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-10-26 19:17:52,243 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-10-26 19:17:54,302 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-26 19:17:54,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:17:54,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:17:56,853 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__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))) is different from true [2018-10-26 19:17:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-10-26 19:17:56,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:17:59,141 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-10-26 19:18:03,015 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-10-26 19:18:05,510 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-10-26 19:18:08,287 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-10-26 19:18:11,070 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-10-26 19:18:14,066 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-10-26 19:18:17,068 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-10-26 19:18:20,260 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-10-26 19:18:23,495 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-10-26 19:18:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-10-26 19:18:23,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:18:23,547 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:18:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 19:19:08,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-26 19:19:08,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Forcibly destroying the process [2018-10-26 19:19:10,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:19:10,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-26 19:19:10,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 19:19:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 19:19:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=45, Unknown=10, NotChecked=102, Total=182 [2018-10-26 19:19:10,325 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-10-26 19:19:13,508 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-10-26 19:19:16,453 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-10-26 19:19:19,252 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-10-26 19:19:21,785 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-10-26 19:19:24,075 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-10-26 19:19:39,393 WARN L179 SmtUtils]: Spent 10.91 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-26 19:19:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:19:49,648 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-26 19:19:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:19:49,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-26 19:19:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:19:49,650 INFO L225 Difference]: With dead ends: 19 [2018-10-26 19:19:49,650 INFO L226 Difference]: Without dead ends: 16 [2018-10-26 19:19:49,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=38, Invalid=62, Unknown=16, NotChecked=264, Total=380 [2018-10-26 19:19:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-26 19:19:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-26 19:19:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-26 19:19:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-26 19:19:49,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-26 19:19:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:19:49,656 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-26 19:19:49,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 19:19:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-26 19:19:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 19:19:49,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:19:49,657 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:19:49,657 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:19:49,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:19:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-10-26 19:19:49,658 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:19:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-10-26 19:19:49,664 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-10-26 19:19:51,662 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-26 19:19:51,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:19:51,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:20:14,148 WARN L179 SmtUtils]: Spent 6.88 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 19:20:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:20:14,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:20:21,019 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-10-26 19:20:23,289 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-10-26 19:20:25,824 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-10-26 19:20:28,349 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-10-26 19:20:31,135 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-10-26 19:20:33,906 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-10-26 19:20:36,924 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-10-26 19:20:39,951 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-10-26 19:20:43,197 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-10-26 19:20:46,476 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-10-26 19:20:49,860 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-10-26 19:20:53,149 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-10-26 19:20:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-10-26 19:20:53,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:20:53,192 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:20:53,200 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 19:21:31,834 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-26 19:21:31,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Forcibly destroying the process [2018-10-26 19:21:33,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:21:33,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-10-26 19:21:33,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 19:21:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 19:21:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=83, Unknown=19, NotChecked=138, Total=272 [2018-10-26 19:21:33,424 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-10-26 19:21:37,206 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 ((_ 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)))) (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-10-26 19:21:40,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (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)))) (= ((_ 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-10-26 19:21:43,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (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)))) (= ((_ 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-10-26 19:21:46,331 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 ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (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 c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-10-26 19:21:48,872 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) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-10-26 19:21:51,151 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 (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)) c_main_~main__x1~0) (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)))))) is different from true [2018-10-26 19:22:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:22:03,112 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-26 19:22:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:22:03,115 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-26 19:22:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:22:03,115 INFO L225 Difference]: With dead ends: 20 [2018-10-26 19:22:03,115 INFO L226 Difference]: Without dead ends: 17 [2018-10-26 19:22:03,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.0s TimeCoverageRelationStatistics Valid=44, Invalid=89, Unknown=25, NotChecked=348, Total=506 [2018-10-26 19:22:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-26 19:22:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-26 19:22:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-26 19:22:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-26 19:22:03,124 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-26 19:22:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:22:03,124 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-26 19:22:03,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 19:22:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-26 19:22:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 19:22:03,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:22:03,125 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:22:03,126 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:22:03,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:22:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-10-26 19:22:03,129 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:22:03,130 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-10-26 19:22:03,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-10-26 19:22:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:05,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:22:07,920 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-10-26 19:22:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-10-26 19:22:07,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:22:10,244 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-10-26 19:22:12,504 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-10-26 19:22:15,017 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-10-26 19:22:17,513 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-10-26 19:22:20,268 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-10-26 19:22:23,039 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-10-26 19:22:26,040 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-10-26 19:22:29,051 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-10-26 19:22:32,316 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-10-26 19:22:35,573 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-10-26 19:22:39,280 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-10-26 19:22:42,945 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-10-26 19:22:46,620 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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-10-26 19:22:50,310 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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-10-26 19:22:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2018-10-26 19:22:50,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:22:50,374 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:22:50,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:23:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Forcibly destroying the process [2018-10-26 19:23:04,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:23:04,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-26 19:23:04,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 19:23:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 19:23:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=15, NotChecked=184, Total=306 [2018-10-26 19:23:04,138 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 18 states. [2018-10-26 19:23:07,886 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .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-10-26 19:23:11,578 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 ((_ 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))) (= ((_ 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-10-26 19:23:14,907 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 ((_ 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-10-26 19:23:17,958 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 ((_ to_fp 11 53) RNE 1.0))) .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 ((_ 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-10-26 19:23:20,748 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 (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 19:23:23,267 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 (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)) 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-10-26 19:23:29,883 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 (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-10-26 19:23:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:23:40,202 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-26 19:23:40,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:23:40,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-10-26 19:23:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:23:40,204 INFO L225 Difference]: With dead ends: 21 [2018-10-26 19:23:40,204 INFO L226 Difference]: Without dead ends: 18 [2018-10-26 19:23:40,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.1s TimeCoverageRelationStatistics Valid=47, Invalid=81, Unknown=22, NotChecked=450, Total=600 [2018-10-26 19:23:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-26 19:23:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-26 19:23:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-26 19:23:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-26 19:23:40,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-26 19:23:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:23:40,217 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-26 19:23:40,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 19:23:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-26 19:23:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-26 19:23:40,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:23:40,220 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:23:40,220 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:23:40,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:23:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2018-10-26 19:23:40,221 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:23:40,221 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-10-26 19:23:40,241 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 19:23:42,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:23:42,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:23:42,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:23:45,293 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 (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))) .cse0))))) is different from true [2018-10-26 19:23:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-10-26 19:23:45,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:23:47,629 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-10-26 19:23:52,049 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-10-26 19:23:54,576 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-10-26 19:23:57,349 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-10-26 19:24:00,120 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-10-26 19:24:03,185 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-10-26 19:24:06,191 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-10-26 19:24:09,469 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-10-26 19:24:12,725 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-10-26 19:24:16,448 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-10-26 19:24:20,176 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-10-26 19:24:23,952 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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-10-26 19:24:27,706 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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-10-26 19:24:31,462 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 ((_ 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))) .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-10-26 19:24:35,208 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 ((_ 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))) .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-10-26 19:24:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-10-26 19:24:35,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:35,255 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:24:35,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 19:24:49,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:24:49,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Forcibly destroying the process [2018-10-26 19:24:51,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:51,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-10-26 19:24:51,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 19:24:51,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 19:24:51,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=113, Unknown=16, NotChecked=252, Total=420 [2018-10-26 19:24:51,816 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-10-26 19:24:55,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0))) (.cse2 ((_ to_fp 8 24) RNE (_ bv0 32)))) (and (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 ((_ 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))) .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 .cse2))) (= ((_ 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)) 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 .cse2)))) is different from true [2018-10-26 19:24:59,392 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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)))) (= ((_ 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-10-26 19:25:03,132 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) (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)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-10-26 19:25:06,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (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)))) (= ((_ 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-10-26 19:25:09,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (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)))) (= ((_ 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))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 19:25:12,344 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 (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)) c_main_~main__x1~0) (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 c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-10-26 19:25:14,904 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 (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)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-10-26 19:25:37,690 WARN L179 SmtUtils]: Spent 13.53 s on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-10-26 19:25:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:40,347 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-26 19:25:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 19:25:40,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-10-26 19:25:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:40,349 INFO L225 Difference]: With dead ends: 22 [2018-10-26 19:25:40,349 INFO L226 Difference]: Without dead ends: 19 [2018-10-26 19:25:40,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 95.7s TimeCoverageRelationStatistics Valid=56, Invalid=140, Unknown=24, NotChecked=592, Total=812 [2018-10-26 19:25:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-26 19:25:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-26 19:25:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-26 19:25:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-26 19:25:40,366 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-26 19:25:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:40,366 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-26 19:25:40,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 19:25:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-26 19:25:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 19:25:40,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:40,367 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:25:40,367 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1545361012, now seen corresponding path program 9 times [2018-10-26 19:25:40,368 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 19:25:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbe7d091-72e8-42d2-84f3-c5b62e544466/bin-2019/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-10-26 19:25:40,380 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 19:25:43,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-26 19:25:43,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:25:43,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:25:46,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= 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 (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))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 19:25:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2018-10-26 19:25:46,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:25:49,540 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-10-26 19:25:52,059 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-10-26 19:25:54,576 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-10-26 19:25:57,352 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-10-26 19:26:00,135 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-10-26 19:26:03,150 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-10-26 19:26:06,221 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-10-26 19:26:09,499 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-10-26 19:26:12,775 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-10-26 19:26:16,498 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-10-26 19:26:19,799 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-10-26 19:26:23,602 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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-10-26 19:26:26,919 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 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .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-10-26 19:26:30,236 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 ((_ 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))) .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-10-26 19:26:32,284 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-10-26 19:26:32,485 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2018-10-26 19:26:32,486 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:845) 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-10-26 19:26:32,489 INFO L168 Benchmark]: Toolchain (without parser) took 756560.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:32,490 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:26:32,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.56 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:32,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.08 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:26:32,491 INFO L168 Benchmark]: Boogie Preprocessor took 22.02 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:32,492 INFO L168 Benchmark]: RCFGBuilder took 2515.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:32,492 INFO L168 Benchmark]: TraceAbstraction took 753735.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 70.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:32,508 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.56 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.08 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.02 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2515.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 753735.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 70.2 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...