./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:56:14,549 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:56:14,550 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:56:14,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:56:14,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:56:14,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:56:14,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:56:14,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:56:14,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:56:14,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:56:14,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:56:14,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:56:14,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:56:14,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:56:14,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:56:14,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:56:14,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:56:14,567 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:56:14,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:56:14,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:56:14,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:56:14,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:56:14,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:56:14,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:56:14,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:56:14,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:56:14,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:56:14,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:56:14,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:56:14,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:56:14,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:56:14,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:56:14,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:56:14,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:56:14,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:56:14,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:56:14,576 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:56:14,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:56:14,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:56:14,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:56:14,584 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:56:14,584 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:56:14,584 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:56:14,584 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:56:14,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:56:14,585 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:56:14,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:56:14,586 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:56:14,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:56:14,586 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_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2018-11-22 21:56:14,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:56:14,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:56:14,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:56:14,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:56:14,621 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:56:14,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-22 21:56:14,662 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/ca739b6a1/4a6dbd7e2ed4470398c5348f18cb3f35/FLAG89e5ddf42 [2018-11-22 21:56:15,058 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:56:15,059 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-22 21:56:15,063 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/ca739b6a1/4a6dbd7e2ed4470398c5348f18cb3f35/FLAG89e5ddf42 [2018-11-22 21:56:15,076 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/ca739b6a1/4a6dbd7e2ed4470398c5348f18cb3f35 [2018-11-22 21:56:15,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:56:15,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:56:15,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:56:15,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:56:15,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:56:15,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1528b193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15, skipping insertion in model container [2018-11-22 21:56:15,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:56:15,106 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:56:15,221 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:56:15,223 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:56:15,237 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:56:15,250 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:56:15,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15 WrapperNode [2018-11-22 21:56:15,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:56:15,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:56:15,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:56:15,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:56:15,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:56:15,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:56:15,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:56:15,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:56:15,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... [2018-11-22 21:56:15,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:56:15,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:56:15,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:56:15,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:56:15,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:56:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:56:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:56:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-22 21:56:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-22 21:56:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-22 21:56:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-22 21:56:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-22 21:56:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-22 21:56:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:56:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:56:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 21:56:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:56:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:56:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:56:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:56:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:56:15,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:56:15,578 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 21:56:15,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:56:15 BoogieIcfgContainer [2018-11-22 21:56:15,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:56:15,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:56:15,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:56:15,582 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:56:15,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:56:15" (1/3) ... [2018-11-22 21:56:15,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be06695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:56:15, skipping insertion in model container [2018-11-22 21:56:15,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:15" (2/3) ... [2018-11-22 21:56:15,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be06695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:56:15, skipping insertion in model container [2018-11-22 21:56:15,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:56:15" (3/3) ... [2018-11-22 21:56:15,585 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251_true-unreach-call.c [2018-11-22 21:56:15,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:56:15,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-22 21:56:15,613 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-22 21:56:15,635 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:56:15,636 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:56:15,636 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:56:15,636 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:56:15,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:56:15,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:56:15,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:56:15,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:56:15,636 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:56:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-22 21:56:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:56:15,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:15,653 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:15,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:15,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2074573857, now seen corresponding path program 1 times [2018-11-22 21:56:15,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:56:15,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:56:15,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:15,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:15,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:15,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:15,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:56:15,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:56:15,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:56:15,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:56:15,783 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-22 21:56:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:15,802 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2018-11-22 21:56:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:56:15,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-22 21:56:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:15,810 INFO L225 Difference]: With dead ends: 109 [2018-11-22 21:56:15,810 INFO L226 Difference]: Without dead ends: 61 [2018-11-22 21:56:15,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:56:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-22 21:56:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-22 21:56:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-22 21:56:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-22 21:56:15,842 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-22 21:56:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:15,843 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-22 21:56:15,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:56:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-22 21:56:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 21:56:15,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:15,845 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:15,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:15,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash -479509601, now seen corresponding path program 1 times [2018-11-22 21:56:15,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:56:15,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:56:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:15,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:15,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:15,913 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-22 21:56:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:16,006 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2018-11-22 21:56:16,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:56:16,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-22 21:56:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:16,008 INFO L225 Difference]: With dead ends: 112 [2018-11-22 21:56:16,008 INFO L226 Difference]: Without dead ends: 70 [2018-11-22 21:56:16,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:56:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-22 21:56:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-11-22 21:56:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-22 21:56:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2018-11-22 21:56:16,015 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2018-11-22 21:56:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:16,015 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2018-11-22 21:56:16,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2018-11-22 21:56:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-22 21:56:16,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:16,016 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:16,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:16,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1695952933, now seen corresponding path program 1 times [2018-11-22 21:56:16,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:56:16,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:56:16,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:16,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 21:56:16,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:16,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:16,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:16,068 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 4 states. [2018-11-22 21:56:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:16,089 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-22 21:56:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:16,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-22 21:56:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:16,092 INFO L225 Difference]: With dead ends: 89 [2018-11-22 21:56:16,092 INFO L226 Difference]: Without dead ends: 67 [2018-11-22 21:56:16,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-22 21:56:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-22 21:56:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-22 21:56:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-22 21:56:16,100 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 42 [2018-11-22 21:56:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:16,100 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-22 21:56:16,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-22 21:56:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-22 21:56:16,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:16,102 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:16,102 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:16,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:16,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1516736276, now seen corresponding path program 1 times [2018-11-22 21:56:16,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:56:16,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:56:16,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:16,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 21:56:16,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:16,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:16,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:16,159 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 4 states. [2018-11-22 21:56:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:16,183 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2018-11-22 21:56:16,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:16,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-22 21:56:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:16,184 INFO L225 Difference]: With dead ends: 93 [2018-11-22 21:56:16,184 INFO L226 Difference]: Without dead ends: 71 [2018-11-22 21:56:16,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-22 21:56:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-22 21:56:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-22 21:56:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-22 21:56:16,188 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 45 [2018-11-22 21:56:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:16,189 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-22 21:56:16,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-22 21:56:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-22 21:56:16,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:16,190 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:16,190 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:16,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1006202099, now seen corresponding path program 1 times [2018-11-22 21:56:16,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:56:16,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:56:16,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:16,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 21:56:16,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:16,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:56:16,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:56:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:56:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:56:16,232 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 3 states. [2018-11-22 21:56:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:16,243 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-22 21:56:16,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:56:16,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-22 21:56:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:16,244 INFO L225 Difference]: With dead ends: 70 [2018-11-22 21:56:16,244 INFO L226 Difference]: Without dead ends: 68 [2018-11-22 21:56:16,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:56:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-22 21:56:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-22 21:56:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-22 21:56:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2018-11-22 21:56:16,249 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 45 [2018-11-22 21:56:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:16,250 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-11-22 21:56:16,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:56:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2018-11-22 21:56:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-22 21:56:16,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:16,251 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:16,251 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:16,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1226294786, now seen corresponding path program 1 times [2018-11-22 21:56:16,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:56:16,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:56:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:56:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:56:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:56:16,305 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2139095048, |#NULL.offset|=2139095042, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] RET #130#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := #t~nondet5;havoc #t~nondet5;~y~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := isnan_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] assume true; VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] RET #134#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#t~short9 := 0 != #t~ret7; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~short9|=true] [?] assume #t~short9; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~short9|=true] [?] CALL call #t~ret8 := isnan_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] RET #136#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short9|=true] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;#t~short9 := 0 == #t~ret8; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short9|=true] [?] #t~short13 := #t~short9; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short13|=true, |main_#t~short9|=true] [?] assume #t~short13; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short13|=true, |main_#t~short9|=true] [?] assume #t~short13;havoc #t~ret7;havoc #t~ret8;havoc #t~short13;havoc #t~ret11;havoc #t~ret10;havoc #t~short9;havoc #t~short12; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] goto; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0, |__fpclassify_float_#res|=0] [?] RET #152#return; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#res|=2139095043.0] [?] assume true; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#res|=2139095043.0] [?] RET #142#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret14|=2139095043.0] [?] ~res~0 := #t~ret14;havoc #t~ret14; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret15 := isnan_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] assume true; VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] RET #144#return; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1] [?] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647;#t~short17 := 0 != #t~ret15; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~short17|=true] [?] assume #t~short17; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~short17|=true] [?] CALL call #t~ret16 := isnan_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] RET #146#return; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~ret16|=0, |main_#t~short17|=true] [?] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;#t~short17 := 0 == #t~ret16; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~ret16|=0, |main_#t~short17|=true] [?] assume #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0);havoc #t~ret16;havoc #t~ret15;havoc #t~short17; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] assume #t~short13; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L83] assume #t~short13; [L67] havoc #t~ret7; [L67] havoc #t~ret8; [L67-L68] havoc #t~short13; [L68] havoc #t~ret11; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L68] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L24] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L25] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] ~w~0 := #t~mem0; [L26] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L24] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L24] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29-L40] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L31-L40] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L34-L40] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L37-L40] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L20-L41] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44-L46] assume 0 == #t~ret2; [L44] havoc #t~ret2; [L45] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L43-L52] ensures true; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume #t~short17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73-L76] assume #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L73] havoc #t~ret16; [L73] havoc #t~ret15; [L73] havoc #t~short17; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] assume #t~short13; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L83] assume #t~short13; [L67] havoc #t~ret7; [L67] havoc #t~ret8; [L67-L68] havoc #t~short13; [L68] havoc #t~ret11; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L68] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L24] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L25] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] ~w~0 := #t~mem0; [L26] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L24] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L24] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29-L40] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L31-L40] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L34-L40] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L37-L40] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L20-L41] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44-L46] assume 0 == #t~ret2; [L44] havoc #t~ret2; [L45] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L43-L52] ensures true; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume #t~short17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73-L76] assume #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L73] havoc #t~ret16; [L73] havoc #t~ret15; [L73] havoc #t~short17; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret7; [L67] havoc #t~ret8; [L67-L68] havoc #t~short13; [L68] havoc #t~ret11; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L68] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L31-L32] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L34-L35] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret16; [L73] havoc #t~ret15; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret7; [L67] havoc #t~ret8; [L67-L68] havoc #t~short13; [L68] havoc #t~ret11; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L68] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L31-L32] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L34-L35] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret16; [L73] havoc #t~ret15; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret7; [L67] havoc #t~ret8; [L67-L68] havoc #t~short13; [L68] havoc #t~ret11; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L68] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L31-L32] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L34-L35] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret16; [L73] havoc #t~ret15; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret7; [L67] havoc #t~ret8; [L67-L68] havoc #t~short13; [L68] havoc #t~ret11; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L68] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L31-L32] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L34-L35] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret16; [L73] havoc #t~ret15; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L67] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L67] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L67] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L67] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L44] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L21] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L44] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L70] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095043, x=2139095044, y=2139095043] [L70] float res = fmax_float(x, y); [L73] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L73] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L73] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=2139095043, x=2139095044, y=2139095043] [L73] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L73] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L73] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] ----- [2018-11-22 21:56:16,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:56:16 BoogieIcfgContainer [2018-11-22 21:56:16,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:56:16,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:56:16,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:56:16,360 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:56:16,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:56:15" (3/4) ... [2018-11-22 21:56:16,363 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:56:16,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:56:16,364 INFO L168 Benchmark]: Toolchain (without parser) took 1285.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -69.2 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:16,365 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:16,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:16,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.08 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:16,369 INFO L168 Benchmark]: Boogie Preprocessor took 59.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:16,370 INFO L168 Benchmark]: RCFGBuilder took 251.40 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:16,370 INFO L168 Benchmark]: TraceAbstraction took 779.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:16,371 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:16,374 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.08 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 251.40 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 779.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L67] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L67] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L67] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L67] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L44] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L21] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L44] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L70] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095043, x=2139095044, y=2139095043] [L70] float res = fmax_float(x, y); [L73] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L73] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L73] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=2139095043, x=2139095044, y=2139095043] [L73] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L73] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L73] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 66 locations, 2 error locations. UNSAFE Result, 0.7s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 16 SDslu, 523 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 8870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 33/33 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-aa41828 [2018-11-22 21:56:17,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:56:17,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:56:17,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:56:17,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:56:17,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:56:17,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:56:17,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:56:17,849 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:56:17,850 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:56:17,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:56:17,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:56:17,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:56:17,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:56:17,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:56:17,853 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:56:17,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:56:17,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:56:17,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:56:17,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:56:17,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:56:17,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:56:17,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:56:17,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:56:17,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:56:17,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:56:17,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:56:17,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:56:17,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:56:17,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:56:17,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:56:17,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:56:17,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:56:17,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:56:17,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:56:17,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:56:17,866 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 21:56:17,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:56:17,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:56:17,877 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:56:17,877 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:56:17,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:56:17,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:56:17,878 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:56:17,878 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:56:17,878 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:56:17,878 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:56:17,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:56:17,879 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:56:17,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:56:17,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:56:17,879 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:56:17,879 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:56:17,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:56:17,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:56:17,880 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:56:17,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:56:17,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:56:17,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:56:17,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:56:17,881 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:56:17,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:56:17,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:56:17,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:56:17,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:56:17,882 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 21:56:17,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:56:17,882 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:56:17,882 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:56:17,882 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_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2018-11-22 21:56:17,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:56:17,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:56:17,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:56:17,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:56:17,926 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:56:17,927 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-22 21:56:17,972 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/face3c9a6/939876c3d16d44f398f0d2a87fe258ab/FLAG965798217 [2018-11-22 21:56:18,298 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:56:18,299 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-22 21:56:18,304 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/face3c9a6/939876c3d16d44f398f0d2a87fe258ab/FLAG965798217 [2018-11-22 21:56:18,313 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/data/face3c9a6/939876c3d16d44f398f0d2a87fe258ab [2018-11-22 21:56:18,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:56:18,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:56:18,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:56:18,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:56:18,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:56:18,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18, skipping insertion in model container [2018-11-22 21:56:18,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:56:18,348 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:56:18,487 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:56:18,490 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:56:18,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:56:18,526 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:56:18,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18 WrapperNode [2018-11-22 21:56:18,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:56:18,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:56:18,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:56:18,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:56:18,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:56:18,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:56:18,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:56:18,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:56:18,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... [2018-11-22 21:56:18,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:56:18,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:56:18,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:56:18,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:56:18,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:56:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:56:18,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:56:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-22 21:56:18,640 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-22 21:56:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-22 21:56:18,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-22 21:56:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-22 21:56:18,640 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-22 21:56:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:56:18,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:56:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:56:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 21:56:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:56:18,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:56:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-22 21:56:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:56:18,833 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:56:18,856 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:56:18,856 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 21:56:18,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:56:18 BoogieIcfgContainer [2018-11-22 21:56:18,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:56:18,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:56:18,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:56:18,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:56:18,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:56:18" (1/3) ... [2018-11-22 21:56:18,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1191fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:56:18, skipping insertion in model container [2018-11-22 21:56:18,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:56:18" (2/3) ... [2018-11-22 21:56:18,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1191fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:56:18, skipping insertion in model container [2018-11-22 21:56:18,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:56:18" (3/3) ... [2018-11-22 21:56:18,862 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251_true-unreach-call.c [2018-11-22 21:56:18,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:56:18,876 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-22 21:56:18,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-22 21:56:18,908 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:56:18,908 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:56:18,909 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:56:18,909 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:56:18,909 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:56:18,909 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:56:18,909 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:56:18,909 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:56:18,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:56:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-22 21:56:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:56:18,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:18,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:18,926 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:18,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash 127161266, now seen corresponding path program 1 times [2018-11-22 21:56:18,932 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:18,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:18,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:56:19,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:19,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:19,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:56:19,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:56:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:56:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:56:19,038 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-22 21:56:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:19,054 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-11-22 21:56:19,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:56:19,055 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-22 21:56:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:19,061 INFO L225 Difference]: With dead ends: 105 [2018-11-22 21:56:19,061 INFO L226 Difference]: Without dead ends: 59 [2018-11-22 21:56:19,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:56:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-22 21:56:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-22 21:56:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-22 21:56:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-11-22 21:56:19,100 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 35 [2018-11-22 21:56:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:19,101 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-11-22 21:56:19,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:56:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-11-22 21:56:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:56:19,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:19,103 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:19,104 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:19,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash -788283278, now seen corresponding path program 1 times [2018-11-22 21:56:19,105 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:19,105 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:19,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:56:19,219 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:19,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:19,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,228 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 4 states. [2018-11-22 21:56:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:19,270 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2018-11-22 21:56:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:56:19,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-22 21:56:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:19,272 INFO L225 Difference]: With dead ends: 108 [2018-11-22 21:56:19,272 INFO L226 Difference]: Without dead ends: 68 [2018-11-22 21:56:19,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:56:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-22 21:56:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-11-22 21:56:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-22 21:56:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-22 21:56:19,279 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-22 21:56:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:19,279 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-22 21:56:19,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-22 21:56:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-22 21:56:19,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:19,280 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:19,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:19,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash -728340568, now seen corresponding path program 1 times [2018-11-22 21:56:19,281 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:19,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:19,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:19,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:19,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:19,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:19,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:19,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:19,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,371 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-22 21:56:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:19,396 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2018-11-22 21:56:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:19,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-22 21:56:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:19,399 INFO L225 Difference]: With dead ends: 86 [2018-11-22 21:56:19,399 INFO L226 Difference]: Without dead ends: 64 [2018-11-22 21:56:19,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-22 21:56:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-22 21:56:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 21:56:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-22 21:56:19,406 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 41 [2018-11-22 21:56:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:19,406 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-22 21:56:19,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-22 21:56:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-22 21:56:19,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:19,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:19,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:19,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1290130751, now seen corresponding path program 1 times [2018-11-22 21:56:19,408 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:19,408 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:19,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:19,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:19,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:19,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:19,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,476 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-22 21:56:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:19,505 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-22 21:56:19,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:19,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-22 21:56:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:19,509 INFO L225 Difference]: With dead ends: 89 [2018-11-22 21:56:19,509 INFO L226 Difference]: Without dead ends: 67 [2018-11-22 21:56:19,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-22 21:56:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-22 21:56:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 21:56:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-22 21:56:19,517 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 42 [2018-11-22 21:56:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:19,517 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-22 21:56:19,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-22 21:56:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-22 21:56:19,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:19,519 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:19,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:19,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1173472140, now seen corresponding path program 1 times [2018-11-22 21:56:19,520 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:19,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:19,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:19,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:19,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:19,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:19,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:19,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:19,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:19,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,586 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-22 21:56:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:19,606 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-22 21:56:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:19,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-22 21:56:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:19,609 INFO L225 Difference]: With dead ends: 89 [2018-11-22 21:56:19,610 INFO L226 Difference]: Without dead ends: 67 [2018-11-22 21:56:19,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-22 21:56:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-22 21:56:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 21:56:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-22 21:56:19,616 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 43 [2018-11-22 21:56:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:19,616 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-22 21:56:19,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-22 21:56:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 21:56:19,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:19,618 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:19,618 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:19,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash -707704861, now seen corresponding path program 1 times [2018-11-22 21:56:19,619 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:19,619 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:19,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:19,676 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:19,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:19,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:19,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,685 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-22 21:56:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:19,698 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-22 21:56:19,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:19,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-22 21:56:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:19,699 INFO L225 Difference]: With dead ends: 89 [2018-11-22 21:56:19,699 INFO L226 Difference]: Without dead ends: 67 [2018-11-22 21:56:19,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-22 21:56:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-22 21:56:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 21:56:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-22 21:56:19,703 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 44 [2018-11-22 21:56:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:19,703 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-22 21:56:19,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-22 21:56:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 21:56:19,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:19,704 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:19,704 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:19,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:19,705 INFO L82 PathProgramCache]: Analyzing trace with hash 799846948, now seen corresponding path program 1 times [2018-11-22 21:56:19,705 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:19,705 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:19,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:19,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 21:56:19,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:20,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:20,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-22 21:56:20,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 21:56:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 21:56:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:56:20,066 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 13 states. [2018-11-22 21:56:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:20,521 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-22 21:56:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:56:20,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-22 21:56:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:20,522 INFO L225 Difference]: With dead ends: 104 [2018-11-22 21:56:20,523 INFO L226 Difference]: Without dead ends: 90 [2018-11-22 21:56:20,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-22 21:56:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-22 21:56:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2018-11-22 21:56:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-22 21:56:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2018-11-22 21:56:20,530 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 44 [2018-11-22 21:56:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:20,530 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2018-11-22 21:56:20,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 21:56:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2018-11-22 21:56:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-22 21:56:20,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:20,531 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:20,532 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:20,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1279812067, now seen corresponding path program 1 times [2018-11-22 21:56:20,532 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:20,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:20,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:56:20,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:20,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:20,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:56:20,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:56:20,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:56:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:56:20,658 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand 8 states. [2018-11-22 21:56:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:20,958 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2018-11-22 21:56:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:56:20,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-22 21:56:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:20,960 INFO L225 Difference]: With dead ends: 133 [2018-11-22 21:56:20,960 INFO L226 Difference]: Without dead ends: 89 [2018-11-22 21:56:20,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:56:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-22 21:56:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2018-11-22 21:56:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-22 21:56:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2018-11-22 21:56:20,970 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 46 [2018-11-22 21:56:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:20,971 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2018-11-22 21:56:20,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:56:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2018-11-22 21:56:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-22 21:56:20,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:20,972 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:20,973 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:20,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:20,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1644657967, now seen corresponding path program 1 times [2018-11-22 21:56:20,973 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:20,974 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:20,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:21,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 21:56:21,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:21,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:56:21,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:56:21,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:56:21,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:56:21,029 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand 3 states. [2018-11-22 21:56:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:21,038 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2018-11-22 21:56:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:56:21,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-22 21:56:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:21,040 INFO L225 Difference]: With dead ends: 79 [2018-11-22 21:56:21,040 INFO L226 Difference]: Without dead ends: 77 [2018-11-22 21:56:21,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:56:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-22 21:56:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-22 21:56:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-22 21:56:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2018-11-22 21:56:21,046 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 51 [2018-11-22 21:56:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:21,047 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2018-11-22 21:56:21,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:56:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2018-11-22 21:56:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:56:21,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:21,047 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:21,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:21,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 893668260, now seen corresponding path program 1 times [2018-11-22 21:56:21,048 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:21,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:21,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 21:56:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:21,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-22 21:56:21,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:56:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:56:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:21,331 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 12 states. [2018-11-22 21:56:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:21,588 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2018-11-22 21:56:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:56:21,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-22 21:56:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:21,589 INFO L225 Difference]: With dead ends: 102 [2018-11-22 21:56:21,589 INFO L226 Difference]: Without dead ends: 86 [2018-11-22 21:56:21,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-22 21:56:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-22 21:56:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-11-22 21:56:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-22 21:56:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-11-22 21:56:21,597 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 56 [2018-11-22 21:56:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:21,597 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-22 21:56:21,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:56:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2018-11-22 21:56:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 21:56:21,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:21,598 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:21,598 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:21,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1433909297, now seen corresponding path program 1 times [2018-11-22 21:56:21,599 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:21,599 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:21,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 21:56:21,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 21:56:22,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:22,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-22 21:56:22,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-22 21:56:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 21:56:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-22 21:56:22,154 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand 19 states. [2018-11-22 21:56:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:23,264 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-22 21:56:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:56:23,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-22 21:56:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:23,265 INFO L225 Difference]: With dead ends: 116 [2018-11-22 21:56:23,265 INFO L226 Difference]: Without dead ends: 114 [2018-11-22 21:56:23,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-11-22 21:56:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-22 21:56:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2018-11-22 21:56:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-22 21:56:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2018-11-22 21:56:23,273 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 49 [2018-11-22 21:56:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:23,274 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2018-11-22 21:56:23,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-22 21:56:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2018-11-22 21:56:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:56:23,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:23,275 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:23,275 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:23,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1435611684, now seen corresponding path program 1 times [2018-11-22 21:56:23,276 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:23,276 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:23,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 21:56:23,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 21:56:23,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:23,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-22 21:56:23,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 21:56:23,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 21:56:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:56:23,583 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand 14 states. [2018-11-22 21:56:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:24,006 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-22 21:56:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 21:56:24,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-22 21:56:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:24,008 INFO L225 Difference]: With dead ends: 142 [2018-11-22 21:56:24,008 INFO L226 Difference]: Without dead ends: 89 [2018-11-22 21:56:24,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-22 21:56:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-22 21:56:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-22 21:56:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-22 21:56:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-11-22 21:56:24,017 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 56 [2018-11-22 21:56:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:24,017 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-11-22 21:56:24,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 21:56:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-11-22 21:56:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-22 21:56:24,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:24,019 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:24,019 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:24,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 374913712, now seen corresponding path program 1 times [2018-11-22 21:56:24,020 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:24,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:24,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 21:56:24,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 21:56:24,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:24,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-22 21:56:24,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:56:24,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:56:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:24,288 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 12 states. [2018-11-22 21:56:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:24,554 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2018-11-22 21:56:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:56:24,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-22 21:56:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:24,555 INFO L225 Difference]: With dead ends: 92 [2018-11-22 21:56:24,555 INFO L226 Difference]: Without dead ends: 89 [2018-11-22 21:56:24,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-22 21:56:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-22 21:56:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-11-22 21:56:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-22 21:56:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2018-11-22 21:56:24,561 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 58 [2018-11-22 21:56:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:24,561 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2018-11-22 21:56:24,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:56:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-22 21:56:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-22 21:56:24,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:24,562 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:24,562 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:24,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1917965495, now seen corresponding path program 1 times [2018-11-22 21:56:24,563 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:24,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:24,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:24,609 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:24,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:24,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:24,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:24,617 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand 4 states. [2018-11-22 21:56:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:24,628 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2018-11-22 21:56:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:24,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-22 21:56:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:24,629 INFO L225 Difference]: With dead ends: 116 [2018-11-22 21:56:24,629 INFO L226 Difference]: Without dead ends: 86 [2018-11-22 21:56:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-22 21:56:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-22 21:56:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-22 21:56:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-11-22 21:56:24,636 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 54 [2018-11-22 21:56:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:24,636 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-11-22 21:56:24,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-22 21:56:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-22 21:56:24,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:24,637 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:24,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:24,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1403627392, now seen corresponding path program 1 times [2018-11-22 21:56:24,637 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:24,637 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:24,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:24,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:24,700 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:24,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:24,710 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 4 states. [2018-11-22 21:56:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:24,727 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2018-11-22 21:56:24,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:24,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-22 21:56:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:24,729 INFO L225 Difference]: With dead ends: 119 [2018-11-22 21:56:24,730 INFO L226 Difference]: Without dead ends: 89 [2018-11-22 21:56:24,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-22 21:56:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-11-22 21:56:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-22 21:56:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-11-22 21:56:24,737 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 55 [2018-11-22 21:56:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:24,737 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-11-22 21:56:24,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-22 21:56:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:56:24,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:24,738 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:24,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:24,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash -235124114, now seen corresponding path program 1 times [2018-11-22 21:56:24,739 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/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-11-22 21:56:24,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:24,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:24,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:25,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:56:25,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/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-11-22 21:56:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:25,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:25,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:25,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:25,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-22 21:56:25,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:56:25,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:56:25,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:56:25,246 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 8 states. [2018-11-22 21:56:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:25,847 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2018-11-22 21:56:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:56:25,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-22 21:56:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:25,848 INFO L225 Difference]: With dead ends: 114 [2018-11-22 21:56:25,848 INFO L226 Difference]: Without dead ends: 94 [2018-11-22 21:56:25,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:56:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-22 21:56:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-11-22 21:56:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-22 21:56:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-11-22 21:56:25,855 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 56 [2018-11-22 21:56:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:25,855 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-11-22 21:56:25,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:56:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-22 21:56:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:56:25,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:25,856 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:25,856 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:25,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2065698476, now seen corresponding path program 1 times [2018-11-22 21:56:25,856 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:25,856 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/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-11-22 21:56:25,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:25,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-22 21:56:26,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:26,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:26,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-22 21:56:26,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 21:56:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 21:56:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:56:26,056 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 11 states. [2018-11-22 21:56:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:26,768 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2018-11-22 21:56:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:56:26,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-22 21:56:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:26,770 INFO L225 Difference]: With dead ends: 124 [2018-11-22 21:56:26,770 INFO L226 Difference]: Without dead ends: 122 [2018-11-22 21:56:26,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:56:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-22 21:56:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2018-11-22 21:56:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-22 21:56:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-11-22 21:56:26,778 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 56 [2018-11-22 21:56:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:26,779 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-22 21:56:26,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 21:56:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2018-11-22 21:56:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:56:26,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:26,780 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:26,780 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:26,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash -341505115, now seen corresponding path program 1 times [2018-11-22 21:56:26,780 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:26,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:26,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:26,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:26,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:26,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:26,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:26,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:26,857 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 4 states. [2018-11-22 21:56:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:26,870 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-11-22 21:56:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:26,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-22 21:56:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:26,871 INFO L225 Difference]: With dead ends: 127 [2018-11-22 21:56:26,871 INFO L226 Difference]: Without dead ends: 97 [2018-11-22 21:56:26,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-22 21:56:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-22 21:56:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-22 21:56:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-11-22 21:56:26,877 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 56 [2018-11-22 21:56:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:26,877 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-22 21:56:26,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2018-11-22 21:56:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-22 21:56:26,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:26,879 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:26,879 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:26,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1176443467, now seen corresponding path program 1 times [2018-11-22 21:56:26,880 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:26,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:26,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-22 21:56:27,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:27,490 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-22 21:56:27,826 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-22 21:56:28,136 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-22 21:56:28,593 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-22 21:56:28,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:56:28,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:56:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:28,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 21:56:28,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:29,048 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-22 21:56:29,684 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-22 21:56:29,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:29,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 17 [2018-11-22 21:56:29,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 21:56:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 21:56:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-22 21:56:29,830 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 17 states. [2018-11-22 21:56:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:31,635 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2018-11-22 21:56:31,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 21:56:31,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-11-22 21:56:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:31,636 INFO L225 Difference]: With dead ends: 132 [2018-11-22 21:56:31,636 INFO L226 Difference]: Without dead ends: 113 [2018-11-22 21:56:31,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-11-22 21:56:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-22 21:56:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-11-22 21:56:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-22 21:56:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2018-11-22 21:56:31,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 63 [2018-11-22 21:56:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:31,646 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2018-11-22 21:56:31,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 21:56:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2018-11-22 21:56:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:56:31,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:31,647 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:31,647 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:31,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1421130064, now seen corresponding path program 1 times [2018-11-22 21:56:31,648 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:31,648 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:31,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:31,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 21:56:31,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 21:56:31,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:31,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-22 21:56:31,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 21:56:31,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 21:56:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:56:31,985 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand 13 states. [2018-11-22 21:56:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:32,281 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2018-11-22 21:56:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:56:32,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-22 21:56:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:32,282 INFO L225 Difference]: With dead ends: 116 [2018-11-22 21:56:32,282 INFO L226 Difference]: Without dead ends: 92 [2018-11-22 21:56:32,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-22 21:56:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-22 21:56:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-22 21:56:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-22 21:56:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2018-11-22 21:56:32,290 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 56 [2018-11-22 21:56:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:32,290 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2018-11-22 21:56:32,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 21:56:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2018-11-22 21:56:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-22 21:56:32,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:32,291 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:32,291 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:32,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1339205341, now seen corresponding path program 1 times [2018-11-22 21:56:32,292 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:32,292 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:32,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:32,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 21:56:32,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:32,975 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-22 21:56:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 21:56:33,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:33,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-22 21:56:33,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-22 21:56:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-22 21:56:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-22 21:56:33,299 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand 21 states. [2018-11-22 21:56:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:34,073 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2018-11-22 21:56:34,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 21:56:34,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-22 21:56:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:34,074 INFO L225 Difference]: With dead ends: 105 [2018-11-22 21:56:34,074 INFO L226 Difference]: Without dead ends: 91 [2018-11-22 21:56:34,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-11-22 21:56:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-22 21:56:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-11-22 21:56:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-22 21:56:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-22 21:56:34,080 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 57 [2018-11-22 21:56:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:34,080 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-22 21:56:34,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-22 21:56:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-22 21:56:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-22 21:56:34,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:34,081 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:34,081 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:34,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -241334884, now seen corresponding path program 1 times [2018-11-22 21:56:34,081 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:34,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:34,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:34,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:56:34,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:34,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:34,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:34,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:34,157 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 4 states. [2018-11-22 21:56:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:34,170 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-22 21:56:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:34,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-22 21:56:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:34,172 INFO L225 Difference]: With dead ends: 111 [2018-11-22 21:56:34,173 INFO L226 Difference]: Without dead ends: 81 [2018-11-22 21:56:34,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-22 21:56:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-11-22 21:56:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-22 21:56:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2018-11-22 21:56:34,180 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 57 [2018-11-22 21:56:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:34,180 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2018-11-22 21:56:34,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2018-11-22 21:56:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-22 21:56:34,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:34,181 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:34,181 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:34,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash -650159109, now seen corresponding path program 1 times [2018-11-22 21:56:34,182 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:34,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:34,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:34,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 21:56:34,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:34,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:34,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-22 21:56:34,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 21:56:34,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 21:56:34,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:56:34,747 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 15 states. [2018-11-22 21:56:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:36,009 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-22 21:56:36,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 21:56:36,010 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-22 21:56:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:36,010 INFO L225 Difference]: With dead ends: 107 [2018-11-22 21:56:36,011 INFO L226 Difference]: Without dead ends: 68 [2018-11-22 21:56:36,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-11-22 21:56:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-22 21:56:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-22 21:56:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 21:56:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-22 21:56:36,015 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 57 [2018-11-22 21:56:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:36,016 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-22 21:56:36,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 21:56:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-22 21:56:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 21:56:36,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:36,016 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:36,017 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:36,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594914, now seen corresponding path program 1 times [2018-11-22 21:56:36,017 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:36,017 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:36,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:36,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-22 21:56:36,300 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:36,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:36,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 21:56:36,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 21:56:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 21:56:36,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:56:36,309 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 9 states. [2018-11-22 21:56:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:36,767 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-22 21:56:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:56:36,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-11-22 21:56:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:36,768 INFO L225 Difference]: With dead ends: 76 [2018-11-22 21:56:36,768 INFO L226 Difference]: Without dead ends: 57 [2018-11-22 21:56:36,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-22 21:56:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-22 21:56:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-22 21:56:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-22 21:56:36,771 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 70 [2018-11-22 21:56:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:36,771 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-22 21:56:36,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 21:56:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-22 21:56:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 21:56:36,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:36,772 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:36,772 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:36,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1573046304, now seen corresponding path program 1 times [2018-11-22 21:56:36,772 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:36,772 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:36,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 21:56:36,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:37,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:37,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 21:56:37,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:56:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:56:37,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:37,008 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 12 states. [2018-11-22 21:56:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:37,554 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-22 21:56:37,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:56:37,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-22 21:56:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:37,555 INFO L225 Difference]: With dead ends: 79 [2018-11-22 21:56:37,555 INFO L226 Difference]: Without dead ends: 58 [2018-11-22 21:56:37,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:56:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-22 21:56:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-22 21:56:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-22 21:56:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-22 21:56:37,559 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 70 [2018-11-22 21:56:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:37,559 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-22 21:56:37,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:56:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-22 21:56:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-22 21:56:37,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:37,560 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:37,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:37,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -193580157, now seen corresponding path program 1 times [2018-11-22 21:56:37,561 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:37,561 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:37,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:37,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 21:56:37,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:37,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 21:56:37,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:56:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:56:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:37,858 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 12 states. [2018-11-22 21:56:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:38,542 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-22 21:56:38,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:56:38,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-22 21:56:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:38,543 INFO L225 Difference]: With dead ends: 81 [2018-11-22 21:56:38,543 INFO L226 Difference]: Without dead ends: 60 [2018-11-22 21:56:38,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:56:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-22 21:56:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-22 21:56:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-22 21:56:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-22 21:56:38,546 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 71 [2018-11-22 21:56:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:38,547 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-22 21:56:38,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:56:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-22 21:56:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-22 21:56:38,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:38,547 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:38,547 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:38,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 997969323, now seen corresponding path program 1 times [2018-11-22 21:56:38,548 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:38,548 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:38,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-22 21:56:38,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:39,068 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-22 21:56:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-22 21:56:39,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:39,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-22 21:56:39,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 21:56:39,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 21:56:39,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:56:39,416 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 17 states. [2018-11-22 21:56:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:40,017 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-22 21:56:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:56:40,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-11-22 21:56:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:40,018 INFO L225 Difference]: With dead ends: 83 [2018-11-22 21:56:40,018 INFO L226 Difference]: Without dead ends: 68 [2018-11-22 21:56:40,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-11-22 21:56:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-22 21:56:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-11-22 21:56:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-22 21:56:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2018-11-22 21:56:40,022 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 71 [2018-11-22 21:56:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:40,022 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2018-11-22 21:56:40,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 21:56:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-22 21:56:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-22 21:56:40,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:40,023 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:40,023 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:40,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1902363068, now seen corresponding path program 1 times [2018-11-22 21:56:40,023 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:40,023 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:40,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:40,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 21:56:40,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 21:56:40,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:56:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:56:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:40,300 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 12 states. [2018-11-22 21:56:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:41,170 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-22 21:56:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:56:41,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-11-22 21:56:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:41,171 INFO L225 Difference]: With dead ends: 85 [2018-11-22 21:56:41,171 INFO L226 Difference]: Without dead ends: 64 [2018-11-22 21:56:41,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:56:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-22 21:56:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-22 21:56:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-22 21:56:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2018-11-22 21:56:41,175 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 72 [2018-11-22 21:56:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:41,175 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2018-11-22 21:56:41,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:56:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-22 21:56:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-22 21:56:41,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:41,176 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:41,176 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:41,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1845453958, now seen corresponding path program 1 times [2018-11-22 21:56:41,177 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:41,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-22 21:56:41,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:56:41,545 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-22 21:56:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-22 21:56:41,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:56:41,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-22 21:56:41,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 21:56:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 21:56:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:56:41,692 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 17 states. [2018-11-22 21:56:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:42,040 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-22 21:56:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:56:42,041 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-22 21:56:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:42,041 INFO L225 Difference]: With dead ends: 78 [2018-11-22 21:56:42,041 INFO L226 Difference]: Without dead ends: 63 [2018-11-22 21:56:42,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-22 21:56:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-22 21:56:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-11-22 21:56:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 21:56:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-22 21:56:42,045 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 72 [2018-11-22 21:56:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:42,045 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-22 21:56:42,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 21:56:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-22 21:56:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-22 21:56:42,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:42,046 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:42,046 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:42,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:42,046 INFO L82 PathProgramCache]: Analyzing trace with hash -562618969, now seen corresponding path program 1 times [2018-11-22 21:56:42,046 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:42,046 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:42,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:42,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 21:56:42,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:42,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:42,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 21:56:42,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:56:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:56:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:56:42,240 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 12 states. [2018-11-22 21:56:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:42,706 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-11-22 21:56:42,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:56:42,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-11-22 21:56:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:42,707 INFO L225 Difference]: With dead ends: 78 [2018-11-22 21:56:42,707 INFO L226 Difference]: Without dead ends: 57 [2018-11-22 21:56:42,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:56:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-22 21:56:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-22 21:56:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 21:56:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-22 21:56:42,711 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 73 [2018-11-22 21:56:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:42,711 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-22 21:56:42,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:56:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-22 21:56:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-22 21:56:42,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:56:42,711 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:56:42,712 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:56:42,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:56:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash 130482728, now seen corresponding path program 1 times [2018-11-22 21:56:42,712 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:56:42,712 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2018-11-22 21:56:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:56:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:56:42,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:56:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-22 21:56:42,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:56:42,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:56:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:56:42,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:56:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:56:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:42,775 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2018-11-22 21:56:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:56:42,779 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-22 21:56:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:56:42,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-22 21:56:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:56:42,780 INFO L225 Difference]: With dead ends: 58 [2018-11-22 21:56:42,780 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:56:42,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:56:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:56:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:56:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:56:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:56:42,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-11-22 21:56:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:56:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:56:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:56:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:56:42,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:56:42,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:56:43,152 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 55) no Hoare annotation was computed. [2018-11-22 21:56:43,153 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 55) the Hoare annotation is: true [2018-11-22 21:56:43,153 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 55) no Hoare annotation was computed. [2018-11-22 21:56:43,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:56:43,153 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:56:43,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:56:43,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:56:43,153 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:56:43,153 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:56:43,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:56:43,153 INFO L444 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (not |main_#t~short9|) (not |main_#t~short13|) (fp.eq main_~x~0 main_~x~0) (= (_ bv0 32) |main_#t~ret7|) (= |main_#t~ret10| (_ bv0 32)) |main_#t~short12|) [2018-11-22 21:56:43,153 INFO L448 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 57 86) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L444 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse1 (fp.eq main_~x~0 main_~x~0)) (.cse0 (fp.eq main_~y~0 main_~y~0))) (or (and (and (= main_~y~0 main_~res~0) .cse0) (not .cse1)) (and (= main_~x~0 main_~res~0) .cse1 (not .cse0)))) [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L73-1(line 73) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L73-2(line 73) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L444 ceAbstractionStarter]: At program point L73-3(line 73) the Hoare annotation is: (and (= main_~y~0 main_~res~0) |main_#t~short17| (fp.eq main_~y~0 main_~y~0) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L73-4(line 73) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L73-6(lines 73 76) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L444 ceAbstractionStarter]: At program point L70(line 70) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and .cse0 (not .cse1)) (and .cse1 (not .cse0)))) [2018-11-22 21:56:43,154 INFO L448 ceAbstractionStarter]: For program point L70-1(line 70) no Hoare annotation was computed. [2018-11-22 21:56:43,154 INFO L444 ceAbstractionStarter]: At program point L79(line 79) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L79-1(line 79) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 57 86) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L444 ceAbstractionStarter]: At program point L79-3(line 79) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short20| (not (fp.eq main_~y~0 main_~y~0))) [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L79-4(line 79) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L79-6(lines 79 82) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L451 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: true [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L444 ceAbstractionStarter]: At program point L67-3(line 67) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret7|) |main_#t~short9| (not (fp.eq main_~x~0 main_~x~0))) [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L67-4(line 67) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2018-11-22 21:56:43,155 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 57 86) the Hoare annotation is: true [2018-11-22 21:56:43,155 INFO L448 ceAbstractionStarter]: For program point L67-6(line 67) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L67-7(lines 67 68) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L67-9(lines 67 83) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L67-11(lines 67 83) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L444 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: (let ((.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse0 (not |main_#t~short9|)) (.cse1 (not |main_#t~short13|))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |main_#t~ret7|)) (and (and (= (_ bv1 32) |main_#t~ret7|) (not .cse2)) (= (bvadd |main_#t~ret8| (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1 (not (fp.eq main_~y~0 main_~y~0))))) [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point fmax_floatEXIT(lines 43 52) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L451 ceAbstractionStarter]: At program point fmax_floatENTRY(lines 43 52) the Hoare annotation is: true [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-22 21:56:43,156 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 48 50) no Hoare annotation was computed. [2018-11-22 21:56:43,156 INFO L444 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 44 46) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point fmax_floatFINAL(lines 43 52) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 20 41) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 27) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 20 41) the Hoare annotation is: true [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 20 41) no Hoare annotation was computed. [2018-11-22 21:56:43,157 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2018-11-22 21:56:43,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:56:43 BoogieIcfgContainer [2018-11-22 21:56:43,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:56:43,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:56:43,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:56:43,169 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:56:43,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:56:18" (3/4) ... [2018-11-22 21:56:43,173 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:56:43,182 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-22 21:56:43,182 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:56:43,182 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:56:43,182 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_float [2018-11-22 21:56:43,182 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-22 21:56:43,186 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-22 21:56:43,187 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 21:56:43,187 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:56:43,205 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-22 21:56:43,225 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4ce54e05-d859-4528-a19a-22dae3153d74/bin-2019/uautomizer/witness.graphml [2018-11-22 21:56:43,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:56:43,226 INFO L168 Benchmark]: Toolchain (without parser) took 24909.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 950.8 MB in the beginning and 841.7 MB in the end (delta: 109.1 MB). Peak memory consumption was 447.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:43,226 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:43,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.14 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 933.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:43,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.16 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:43,227 INFO L168 Benchmark]: Boogie Preprocessor took 22.09 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:43,227 INFO L168 Benchmark]: RCFGBuilder took 289.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:43,227 INFO L168 Benchmark]: TraceAbstraction took 24311.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 850.9 MB in the end (delta: 273.8 MB). Peak memory consumption was 457.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:43,227 INFO L168 Benchmark]: Witness Printer took 56.78 ms. Allocated memory is still 1.4 GB. Free memory was 850.9 MB in the beginning and 841.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:43,229 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.15 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 210.14 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 933.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.16 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.09 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24311.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 850.9 MB in the end (delta: 273.8 MB). Peak memory consumption was 457.8 MB. Max. memory is 11.5 GB. * Witness Printer took 56.78 ms. Allocated memory is still 1.4 GB. Free memory was 850.9 MB in the beginning and 841.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 2 error locations. SAFE Result, 24.2s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2086 SDtfs, 1000 SDslu, 10841 SDs, 0 SdLazy, 4853 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2538 GetRequests, 2194 SyntacticMatches, 8 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 189 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 156 PreInvPairs, 178 NumberOfFragments, 161 HoareAnnotationTreeSize, 156 FomulaSimplifications, 869 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 104 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1859 NumberOfCodeBlocks, 1859 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2336 ConstructedInterpolants, 35 QuantifiedInterpolants, 443305 SizeOfPredicates, 147 NumberOfNonLiveVariables, 3908 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 1085/1205 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...