./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ............................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:07:50,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:07:50,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:07:50,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:07:50,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:07:50,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:07:50,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:07:50,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:07:50,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:07:50,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:07:50,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:07:50,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:07:50,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:07:50,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:07:50,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:07:50,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:07:50,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:07:50,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:07:50,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:07:50,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:07:50,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:07:50,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:07:50,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:07:50,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:07:50,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:07:50,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:07:50,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:07:50,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:07:50,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:07:50,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:07:50,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:07:50,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:07:50,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:07:50,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:07:50,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:07:50,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:07:50,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:07:50,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:07:50,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:07:50,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:07:50,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:07:50,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:07:50,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:07:50,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:07:50,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:07:50,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:07:50,436 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:07:50,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:07:50,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:07:50,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:07:50,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:07:50,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:07:50,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:07:50,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:07:50,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:07:50,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:07:50,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:07:50,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:07:50,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:07:50,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:07:50,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:07:50,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:07:50,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:07:50,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:07:50,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:07:50,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:07:50,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:07:50,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:07:50,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:07:50,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:07:50,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-15 20:07:50,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:07:50,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:07:50,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:07:50,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:07:50,499 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:07:50,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-15 20:07:50,558 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/6fbafc857/bdb93a56bd9544f2a12a3c80a3a62eb6/FLAGc87aad958 [2019-11-15 20:07:50,985 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:07:50,986 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-15 20:07:50,993 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/6fbafc857/bdb93a56bd9544f2a12a3c80a3a62eb6/FLAGc87aad958 [2019-11-15 20:07:51,381 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/6fbafc857/bdb93a56bd9544f2a12a3c80a3a62eb6 [2019-11-15 20:07:51,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:07:51,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:07:51,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:07:51,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:07:51,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:07:51,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fe9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51, skipping insertion in model container [2019-11-15 20:07:51,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,400 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:07:51,417 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:07:51,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:07:51,650 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:07:51,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:07:51,711 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:07:51,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51 WrapperNode [2019-11-15 20:07:51,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:07:51,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:07:51,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:07:51,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:07:51,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:07:51,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:07:51,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:07:51,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:07:51,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... [2019-11-15 20:07:51,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:07:51,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:07:51,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:07:51,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:07:51,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:07:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 20:07:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:07:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:07:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:07:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:07:52,318 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:07:52,319 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-15 20:07:52,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:52 BoogieIcfgContainer [2019-11-15 20:07:52,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:07:52,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:07:52,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:07:52,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:07:52,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:07:51" (1/3) ... [2019-11-15 20:07:52,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a308825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:07:52, skipping insertion in model container [2019-11-15 20:07:52,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:51" (2/3) ... [2019-11-15 20:07:52,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a308825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:07:52, skipping insertion in model container [2019-11-15 20:07:52,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:52" (3/3) ... [2019-11-15 20:07:52,332 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-15 20:07:52,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:07:52,352 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 20:07:52,364 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 20:07:52,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:07:52,400 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:07:52,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:07:52,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:07:52,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:07:52,401 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:07:52,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:07:52,401 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:07:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-15 20:07:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:07:52,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:52,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:52,427 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-15 20:07:52,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:52,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015395306] [2019-11-15 20:07:52,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:52,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015395306] [2019-11-15 20:07:52,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:52,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:52,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527263556] [2019-11-15 20:07:52,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:52,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:52,607 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-15 20:07:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:52,695 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-15 20:07:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:52,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-15 20:07:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:52,709 INFO L225 Difference]: With dead ends: 90 [2019-11-15 20:07:52,709 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 20:07:52,713 INFO L600 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 [2019-11-15 20:07:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 20:07:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-15 20:07:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 20:07:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-15 20:07:52,753 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-15 20:07:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:52,754 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-15 20:07:52,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-15 20:07:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:07:52,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:52,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:52,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-15 20:07:52,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:52,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545888769] [2019-11-15 20:07:52,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:52,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545888769] [2019-11-15 20:07:52,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:52,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:52,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565103862] [2019-11-15 20:07:52,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:52,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:52,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:52,835 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-15 20:07:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:52,916 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-15 20:07:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:07:52,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-15 20:07:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:52,920 INFO L225 Difference]: With dead ends: 77 [2019-11-15 20:07:52,920 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 20:07:52,921 INFO L600 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 [2019-11-15 20:07:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 20:07:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-15 20:07:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 20:07:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-15 20:07:52,938 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-15 20:07:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-15 20:07:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-15 20:07:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:07:52,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:52,942 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:52,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-15 20:07:52,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:52,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699063332] [2019-11-15 20:07:52,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:53,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699063332] [2019-11-15 20:07:53,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:53,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:07:53,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048632839] [2019-11-15 20:07:53,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:07:53,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:53,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:07:53,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:53,015 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-15 20:07:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:53,040 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-15 20:07:53,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:07:53,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 20:07:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:53,042 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:07:53,042 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:07:53,042 INFO L600 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 [2019-11-15 20:07:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:07:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-15 20:07:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 20:07:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-15 20:07:53,048 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-15 20:07:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:53,049 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-15 20:07:53,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:07:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-15 20:07:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:07:53,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:53,050 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:53,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-15 20:07:53,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:53,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810273716] [2019-11-15 20:07:53,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:53,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:53,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:07:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:07:53,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:07:53,165 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:07:53,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:07:53 BoogieIcfgContainer [2019-11-15 20:07:53,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:07:53,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:07:53,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:07:53,197 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:07:53,198 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:52" (3/4) ... [2019-11-15 20:07:53,201 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:07:53,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:07:53,203 INFO L168 Benchmark]: Toolchain (without parser) took 1817.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -87.6 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:53,204 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:07:53,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:53,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.70 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:53,206 INFO L168 Benchmark]: Boogie Preprocessor took 42.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:07:53,207 INFO L168 Benchmark]: RCFGBuilder took 519.88 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:53,207 INFO L168 Benchmark]: TraceAbstraction took 874.49 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:53,208 INFO L168 Benchmark]: Witness Printer took 4.85 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. [2019-11-15 20:07:53,211 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.70 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 519.88 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 874.49 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 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: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L71] float res = fmin_float(x, y); [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-cad4683 [2019-11-15 20:07:55,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:07:55,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:07:55,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:07:55,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:07:55,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:07:55,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:07:55,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:07:55,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:07:55,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:07:55,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:07:55,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:07:55,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:07:55,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:07:55,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:07:55,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:07:55,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:07:55,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:07:55,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:07:55,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:07:55,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:07:55,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:07:55,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:07:55,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:07:55,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:07:55,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:07:55,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:07:55,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:07:55,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:07:55,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:07:55,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:07:55,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:07:55,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:07:55,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:07:55,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:07:55,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:07:55,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:07:55,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:07:55,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:07:55,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:07:55,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:07:55,390 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:07:55,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:07:55,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:07:55,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:07:55,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:07:55,404 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:07:55,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:07:55,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:07:55,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:07:55,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:07:55,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:07:55,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:07:55,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:07:55,406 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:07:55,406 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:07:55,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:07:55,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:07:55,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:07:55,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:07:55,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:07:55,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:07:55,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:07:55,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:07:55,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:07:55,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:07:55,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:07:55,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:07:55,408 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:07:55,408 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:07:55,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:07:55,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:07:55,409 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-15 20:07:55,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:07:55,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:07:55,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:07:55,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:07:55,475 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:07:55,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-15 20:07:55,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/cf956a717/00a2b3007fb5442d8505f472dc2ab6a8/FLAG612c8e714 [2019-11-15 20:07:55,917 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:07:55,918 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-15 20:07:55,924 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/cf956a717/00a2b3007fb5442d8505f472dc2ab6a8/FLAG612c8e714 [2019-11-15 20:07:55,936 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/data/cf956a717/00a2b3007fb5442d8505f472dc2ab6a8 [2019-11-15 20:07:55,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:07:55,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:07:55,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:07:55,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:07:55,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:07:55,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:07:55" (1/1) ... [2019-11-15 20:07:55,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e16acd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:55, skipping insertion in model container [2019-11-15 20:07:55,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:07:55" (1/1) ... [2019-11-15 20:07:55,955 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:07:55,972 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:07:56,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:07:56,166 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:07:56,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:07:56,276 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:07:56,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56 WrapperNode [2019-11-15 20:07:56,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:07:56,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:07:56,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:07:56,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:07:56,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:07:56,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:07:56,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:07:56,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:07:56,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... [2019-11-15 20:07:56,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:07:56,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:07:56,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:07:56,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:07:56,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:07:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:07:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:07:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:07:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-15 20:07:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:07:57,067 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:07:57,067 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-15 20:07:57,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:57 BoogieIcfgContainer [2019-11-15 20:07:57,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:07:57,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:07:57,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:07:57,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:07:57,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:07:55" (1/3) ... [2019-11-15 20:07:57,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777dd6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:07:57, skipping insertion in model container [2019-11-15 20:07:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:56" (2/3) ... [2019-11-15 20:07:57,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777dd6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:07:57, skipping insertion in model container [2019-11-15 20:07:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:57" (3/3) ... [2019-11-15 20:07:57,075 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-15 20:07:57,083 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:07:57,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 20:07:57,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 20:07:57,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:07:57,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:07:57,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:07:57,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:07:57,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:07:57,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:07:57,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:07:57,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:07:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-15 20:07:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:07:57,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:57,147 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:57,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-15 20:07:57,163 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:07:57,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985672691] [2019-11-15 20:07:57,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:57,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 20:07:57,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:07:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:57,282 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:07:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:57,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985672691] [2019-11-15 20:07:57,288 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:57,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 20:07:57,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889848368] [2019-11-15 20:07:57,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:07:57,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:07:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:07:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:07:57,307 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-15 20:07:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:57,328 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-15 20:07:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:07:57,329 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 20:07:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:57,340 INFO L225 Difference]: With dead ends: 82 [2019-11-15 20:07:57,341 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 20:07:57,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:07:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 20:07:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-15 20:07:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 20:07:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-15 20:07:57,383 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-15 20:07:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:57,384 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-15 20:07:57,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:07:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-15 20:07:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:07:57,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:57,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:57,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 20:07:57,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-15 20:07:57,593 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:07:57,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243483097] [2019-11-15 20:07:57,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:57,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:07:57,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:07:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:57,712 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:07:57,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:57,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243483097] [2019-11-15 20:07:57,726 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:57,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 20:07:57,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386454547] [2019-11-15 20:07:57,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:57,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:07:57,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:57,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:57,729 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-15 20:07:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:57,788 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-15 20:07:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:57,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-15 20:07:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:57,790 INFO L225 Difference]: With dead ends: 82 [2019-11-15 20:07:57,791 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 20:07:57,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 20:07:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-15 20:07:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 20:07:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-15 20:07:57,802 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-15 20:07:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:57,802 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-15 20:07:57,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-15 20:07:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:07:57,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:57,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:58,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 20:07:58,017 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-15 20:07:58,020 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:07:58,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238917052] [2019-11-15 20:07:58,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:58,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:07:58,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:07:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:58,152 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:07:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:58,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238917052] [2019-11-15 20:07:58,172 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:58,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 20:07:58,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256095146] [2019-11-15 20:07:58,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:58,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:07:58,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:58,174 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-15 20:07:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:58,335 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-15 20:07:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:07:58,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-15 20:07:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:58,339 INFO L225 Difference]: With dead ends: 96 [2019-11-15 20:07:58,339 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 20:07:58,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 20:07:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-15 20:07:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 20:07:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-15 20:07:58,356 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-15 20:07:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:58,356 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-15 20:07:58,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-15 20:07:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:07:58,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:58,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:58,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 20:07:58,582 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-15 20:07:58,583 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:07:58,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064420721] [2019-11-15 20:07:58,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:58,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:07:58,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:07:58,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:58,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:58,767 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:07:58,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:58,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:58,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064420721] [2019-11-15 20:07:58,842 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:58,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-15 20:07:58,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786998571] [2019-11-15 20:07:58,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:07:58,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:07:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:07:58,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:07:58,844 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-15 20:07:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:59,388 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-11-15 20:07:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:07:59,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 20:07:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:59,391 INFO L225 Difference]: With dead ends: 149 [2019-11-15 20:07:59,391 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 20:07:59,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:07:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 20:07:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-11-15 20:07:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 20:07:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-15 20:07:59,411 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-15 20:07:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:59,413 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-15 20:07:59,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:07:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-15 20:07:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:07:59,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:59,415 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:59,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 20:07:59,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-15 20:07:59,628 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:07:59,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599633807] [2019-11-15 20:07:59,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:07:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:59,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:07:59,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:07:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:59,965 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:00,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:00,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:00,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599633807] [2019-11-15 20:08:00,120 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:00,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-15 20:08:00,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766008475] [2019-11-15 20:08:00,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 20:08:00,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:00,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:08:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:08:00,122 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-15 20:08:00,879 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-15 20:08:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:01,190 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-15 20:08:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:08:01,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-15 20:08:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:01,196 INFO L225 Difference]: With dead ends: 180 [2019-11-15 20:08:01,196 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 20:08:01,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:08:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 20:08:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-15 20:08:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 20:08:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-15 20:08:01,211 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-15 20:08:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:01,211 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-15 20:08:01,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 20:08:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-15 20:08:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:08:01,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:01,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:01,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 20:08:01,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-15 20:08:01,423 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:01,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153480900] [2019-11-15 20:08:01,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:01,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:08:01,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:01,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:01,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:01,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:01,616 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:01,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:01,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:01,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:01,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153480900] [2019-11-15 20:08:01,672 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:01,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-15 20:08:01,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921794907] [2019-11-15 20:08:01,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:08:01,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:01,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:08:01,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:08:01,674 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-15 20:08:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:02,039 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-15 20:08:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:08:02,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-15 20:08:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:02,041 INFO L225 Difference]: With dead ends: 166 [2019-11-15 20:08:02,041 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 20:08:02,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:08:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 20:08:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-15 20:08:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 20:08:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-15 20:08:02,053 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-15 20:08:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:02,053 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-15 20:08:02,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:08:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-15 20:08:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:08:02,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:02,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:02,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 20:08:02,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-15 20:08:02,268 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:02,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276338405] [2019-11-15 20:08:02,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:02,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:08:02,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:02,353 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:02,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276338405] [2019-11-15 20:08:02,366 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:02,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 20:08:02,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436233771] [2019-11-15 20:08:02,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:08:02,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:08:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:08:02,368 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-15 20:08:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:02,452 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-15 20:08:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:08:02,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-15 20:08:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:02,454 INFO L225 Difference]: With dead ends: 157 [2019-11-15 20:08:02,454 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 20:08:02,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:08:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 20:08:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-15 20:08:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:08:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 20:08:02,467 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-15 20:08:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:02,467 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 20:08:02,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:08:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-15 20:08:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:08:02,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:02,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:02,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 20:08:02,682 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-15 20:08:02,683 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:02,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94981347] [2019-11-15 20:08:02,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:02,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:08:02,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:02,758 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:02,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94981347] [2019-11-15 20:08:02,761 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:02,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 20:08:02,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973399121] [2019-11-15 20:08:02,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:08:02,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:08:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:08:02,762 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-15 20:08:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:02,808 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-15 20:08:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:08:02,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 20:08:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:02,810 INFO L225 Difference]: With dead ends: 96 [2019-11-15 20:08:02,810 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 20:08:02,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:08:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 20:08:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-15 20:08:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:08:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 20:08:02,821 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-15 20:08:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:02,822 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 20:08:02,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:08:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-15 20:08:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:08:02,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:02,823 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:03,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 20:08:03,038 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-15 20:08:03,038 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:03,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933171108] [2019-11-15 20:08:03,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:03,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:08:03,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:03,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:03,166 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:03,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:03,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933171108] [2019-11-15 20:08:03,215 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:03,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-15 20:08:03,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382581409] [2019-11-15 20:08:03,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:08:03,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:03,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:08:03,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:08:03,216 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-15 20:08:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:03,593 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-15 20:08:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:08:03,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-15 20:08:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:03,595 INFO L225 Difference]: With dead ends: 131 [2019-11-15 20:08:03,595 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 20:08:03,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:08:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 20:08:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-15 20:08:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 20:08:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-15 20:08:03,608 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-15 20:08:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:03,608 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-15 20:08:03,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:08:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-15 20:08:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:08:03,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:03,609 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:03,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-15 20:08:03,822 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:03,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-15 20:08:03,823 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:03,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144387413] [2019-11-15 20:08:03,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:03,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 20:08:03,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:03,959 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:03,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:04,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144387413] [2019-11-15 20:08:04,019 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:04,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-15 20:08:04,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392896244] [2019-11-15 20:08:04,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 20:08:04,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:08:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:08:04,020 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-15 20:08:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:04,424 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-15 20:08:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:08:04,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-15 20:08:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:04,426 INFO L225 Difference]: With dead ends: 114 [2019-11-15 20:08:04,426 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 20:08:04,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:08:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 20:08:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-15 20:08:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-15 20:08:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-15 20:08:04,432 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-15 20:08:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:04,432 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-15 20:08:04,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 20:08:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-15 20:08:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:08:04,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:04,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:04,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-15 20:08:04,642 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-15 20:08:04,643 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:04,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434376201] [2019-11-15 20:08:04,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:04,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:08:04,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:04,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:04,780 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:04,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:04,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434376201] [2019-11-15 20:08:04,830 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:04,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-15 20:08:04,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498584750] [2019-11-15 20:08:04,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:08:04,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:08:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:08:04,831 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-15 20:08:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:06,788 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-15 20:08:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:08:06,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 20:08:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:06,789 INFO L225 Difference]: With dead ends: 84 [2019-11-15 20:08:06,789 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 20:08:06,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:08:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 20:08:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 20:08:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 20:08:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-15 20:08:06,795 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-15 20:08:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:06,795 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-15 20:08:06,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:08:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-15 20:08:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:08:06,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:06,796 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:06,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-15 20:08:06,997 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-15 20:08:06,997 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:06,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818946956] [2019-11-15 20:08:06,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:07,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:08:07,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:07,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:07,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:07,168 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:07,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:07,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818946956] [2019-11-15 20:08:07,513 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:07,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 20:08:07,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458141135] [2019-11-15 20:08:07,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:08:07,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:08:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:08:07,514 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-15 20:08:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:07,820 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-15 20:08:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:08:07,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-15 20:08:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:07,822 INFO L225 Difference]: With dead ends: 82 [2019-11-15 20:08:07,822 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 20:08:07,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:08:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 20:08:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 20:08:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 20:08:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-15 20:08:07,828 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-15 20:08:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:07,828 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-15 20:08:07,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:08:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-15 20:08:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:08:07,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:07,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:08,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-15 20:08:08,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-15 20:08:08,030 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:08,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432024914] [2019-11-15 20:08:08,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:08,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:08:08,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:08,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:08,229 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:08,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432024914] [2019-11-15 20:08:08,417 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:08,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-15 20:08:08,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706736048] [2019-11-15 20:08:08,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:08:08,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:08:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:08:08,418 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-15 20:08:08,712 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 20:08:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:09,718 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-15 20:08:09,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:08:09,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-15 20:08:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:09,719 INFO L225 Difference]: With dead ends: 154 [2019-11-15 20:08:09,719 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 20:08:09,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:08:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 20:08:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-15 20:08:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 20:08:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-15 20:08:09,726 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-15 20:08:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:09,726 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-15 20:08:09,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:08:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-15 20:08:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:08:09,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:09,727 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:09,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-15 20:08:09,940 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-15 20:08:09,940 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:09,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729287073] [2019-11-15 20:08:09,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:10,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:08:10,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:10,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:10,302 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-15 20:08:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:10,307 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:10,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:10,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:10,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729287073] [2019-11-15 20:08:10,480 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:10,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-15 20:08:10,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936655889] [2019-11-15 20:08:10,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 20:08:10,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:08:10,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:08:10,481 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-15 20:08:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:13,531 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-15 20:08:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 20:08:13,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-15 20:08:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:13,532 INFO L225 Difference]: With dead ends: 195 [2019-11-15 20:08:13,532 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:08:13,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 20:08:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:08:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-15 20:08:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 20:08:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-15 20:08:13,538 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-15 20:08:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:13,539 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 20:08:13,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 20:08:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-15 20:08:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 20:08:13,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:13,539 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:13,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-15 20:08:13,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:13,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-15 20:08:13,751 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:13,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287143702] [2019-11-15 20:08:13,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:13,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 20:08:13,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:14,016 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:14,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287143702] [2019-11-15 20:08:14,145 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:14,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-15 20:08:14,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249930128] [2019-11-15 20:08:14,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:08:14,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:08:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:08:14,146 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-15 20:08:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:15,092 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-15 20:08:15,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:08:15,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-15 20:08:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:15,094 INFO L225 Difference]: With dead ends: 125 [2019-11-15 20:08:15,094 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 20:08:15,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:08:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 20:08:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-15 20:08:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:08:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-15 20:08:15,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-15 20:08:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:15,099 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-15 20:08:15,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:08:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-15 20:08:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 20:08:15,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:15,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:15,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-15 20:08:15,300 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-15 20:08:15,301 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:15,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740664620] [2019-11-15 20:08:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:15,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:08:15,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:15,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:15,439 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:15,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740664620] [2019-11-15 20:08:15,614 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:15,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 20:08:15,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873640144] [2019-11-15 20:08:15,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:08:15,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:15,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:08:15,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:08:15,615 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-15 20:08:16,063 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 20:08:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:16,271 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-15 20:08:16,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:08:16,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-15 20:08:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:16,272 INFO L225 Difference]: With dead ends: 52 [2019-11-15 20:08:16,272 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 20:08:16,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:08:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 20:08:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-15 20:08:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:08:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-15 20:08:16,277 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-15 20:08:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:16,277 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-15 20:08:16,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:08:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-15 20:08:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 20:08:16,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:16,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:16,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-15 20:08:16,486 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-15 20:08:16,487 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:16,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977554335] [2019-11-15 20:08:16,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-15 20:08:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:16,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:08:16,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:16,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:16,652 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:16,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:16,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:16,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977554335] [2019-11-15 20:08:16,776 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:16,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 20:08:16,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540743779] [2019-11-15 20:08:16,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:08:16,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:16,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:08:16,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:08:16,776 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-15 20:08:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:17,511 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-15 20:08:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:08:17,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-15 20:08:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:17,512 INFO L225 Difference]: With dead ends: 55 [2019-11-15 20:08:17,512 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 20:08:17,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:08:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 20:08:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-15 20:08:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 20:08:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-15 20:08:17,517 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-15 20:08:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:17,518 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-15 20:08:17,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:08:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-15 20:08:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 20:08:17,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:17,519 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:17,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-15 20:08:17,730 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-15 20:08:17,731 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:17,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036293954] [2019-11-15 20:08:17,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:17,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 20:08:17,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:17,952 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:08:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:18,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036293954] [2019-11-15 20:08:18,109 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:18,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 20:08:18,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056138273] [2019-11-15 20:08:18,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:08:18,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:18,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:08:18,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:08:18,110 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-15 20:08:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:18,599 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-15 20:08:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:08:18,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 20:08:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:18,600 INFO L225 Difference]: With dead ends: 79 [2019-11-15 20:08:18,600 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 20:08:18,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:08:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 20:08:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-15 20:08:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 20:08:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-15 20:08:18,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-15 20:08:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:18,605 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-15 20:08:18,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:08:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-15 20:08:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 20:08:18,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:18,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:18,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-15 20:08:18,806 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-15 20:08:18,806 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:08:18,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520250109] [2019-11-15 20:08:18,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/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 [2019-11-15 20:08:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:18,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:08:18,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:18,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:08:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:18,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520250109] [2019-11-15 20:08:18,923 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:18,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 20:08:18,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33388843] [2019-11-15 20:08:18,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:08:18,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:08:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:08:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:18,925 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-15 20:08:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:18,951 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-15 20:08:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:08:18,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 20:08:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:18,952 INFO L225 Difference]: With dead ends: 39 [2019-11-15 20:08:18,952 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:08:18,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:08:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:08:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:08:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:08:18,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-15 20:08:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:18,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:08:18,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:08:18,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:08:19,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-15 20:08:19,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:08:19,323 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 87 [2019-11-15 20:08:19,671 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-11-15 20:08:20,175 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-15 20:08:20,758 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 27 [2019-11-15 20:08:21,209 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 32 [2019-11-15 20:08:21,481 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-15 20:08:21,727 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-11-15 20:08:22,071 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-15 20:08:22,586 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2019-11-15 20:08:23,088 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 35 [2019-11-15 20:08:23,271 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-15 20:08:23,299 INFO L443 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-11-15 20:08:23,299 INFO L443 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-11-15 20:08:23,299 INFO L443 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-11-15 20:08:23,299 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 20:08:23,299 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L446 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-15 20:08:23,300 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 20:08:23,301 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-15 20:08:23,301 INFO L439 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)))) [2019-11-15 20:08:23,301 INFO L443 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-15 20:08:23,301 INFO L443 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-15 20:08:23,301 INFO L439 ceAbstractionStarter]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-15 20:08:23,301 INFO L443 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-15 20:08:23,301 INFO L439 ceAbstractionStarter]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmin_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (and (and (and .cse0 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)))) [2019-11-15 20:08:23,301 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:08:23,301 INFO L439 ceAbstractionStarter]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) .cse3) (and .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not .cse3) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-11-15 20:08:23,301 INFO L439 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short11| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (not |ULTIMATE.start_main_#t~short11|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0))))) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-3(line 57) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short15|) (not |ULTIMATE.start_main_#t~short11|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short14|) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 .cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y .cse3) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq .cse3 .cse3)) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (and |ULTIMATE.start_main_#t~short19| .cse1) .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and .cse0 |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse1))) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-6(line 57) the Hoare annotation is: (or (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) [2019-11-15 20:08:23,302 INFO L439 ceAbstractionStarter]: At program point L57-7(line 57) the Hoare annotation is: (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L439 ceAbstractionStarter]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse1 .cse1))) (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 20:08:23,303 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-15 20:08:23,304 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-15 20:08:23,304 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-15 20:08:23,304 INFO L443 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-15 20:08:23,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:08:23 BoogieIcfgContainer [2019-11-15 20:08:23,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:08:23,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:08:23,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:08:23,361 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:08:23,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:57" (3/4) ... [2019-11-15 20:08:23,364 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:08:23,376 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-15 20:08:23,376 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 20:08:23,377 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 20:08:23,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-15 20:08:23,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-15 20:08:23,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-15 20:08:23,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-15 20:08:23,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && x == x) [2019-11-15 20:08:23,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == x) && (((y == y && !(0bv32 == \result)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && x == x) [2019-11-15 20:08:23,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) || ((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result)) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) [2019-11-15 20:08:23,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-15 20:08:23,401 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) || (((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) && y == y) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) [2019-11-15 20:08:23,401 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1bv32 == \result && ~fp.eq~FLOAT(x, x)) && y == y) && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) [2019-11-15 20:08:23,401 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) [2019-11-15 20:08:23,402 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-15 20:08:23,402 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-15 20:08:23,438 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0069c8c3-2fe2-4b0c-871e-2e9dad43ebdc/bin/uautomizer/witness.graphml [2019-11-15 20:08:23,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:08:23,440 INFO L168 Benchmark]: Toolchain (without parser) took 27500.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 953.7 MB in the beginning and 1.0 GB in the end (delta: -63.8 MB). Peak memory consumption was 249.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:23,440 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:08:23,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:23,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.83 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:23,441 INFO L168 Benchmark]: Boogie Preprocessor took 60.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:08:23,442 INFO L168 Benchmark]: RCFGBuilder took 649.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:23,442 INFO L168 Benchmark]: TraceAbstraction took 26291.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 408.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:23,442 INFO L168 Benchmark]: Witness Printer took 78.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:23,444 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.83 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 649.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26291.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 408.2 MB. Max. memory is 11.5 GB. * Witness Printer took 78.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: 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: 35]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) || ((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result)) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((1bv32 == \result && ~fp.eq~FLOAT(x, x)) && y == y) && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) || (((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) && y == y) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == x) && (((y == y && !(0bv32 == \result)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && x == x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && x == x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 26.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 1149 SDtfs, 2823 SDslu, 4377 SDs, 0 SdLazy, 1918 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 612 HoareAnnotationTreeSize, 14 FomulaSimplifications, 655011 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 9281 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93793 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1375 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...