./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-6b5699a [2019-11-25 08:45:23,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:23,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:23,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:23,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:23,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:23,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:23,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:23,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:23,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:23,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:23,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:23,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:23,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:23,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:23,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:23,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:23,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:23,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:23,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:23,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:23,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:23,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:23,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:23,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:23,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:23,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:23,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:23,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:23,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:23,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:23,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:23,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:23,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:23,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:23,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:23,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:23,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:23,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:23,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:23,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:23,179 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:45:23,202 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:23,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:23,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,214 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,214 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:23,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:23,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:23,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:23,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:23,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:23,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,216 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:23,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:23,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:23,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:23,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:23,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:23,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:45:23,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:23,220 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_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:23,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,407 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,408 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-25 08:45:23,464 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/28df11596/3a9a15de50fe4f11ad57b1312e6b4fd3/FLAG0b15ead2a [2019-11-25 08:45:23,862 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:23,863 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-25 08:45:23,869 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/28df11596/3a9a15de50fe4f11ad57b1312e6b4fd3/FLAG0b15ead2a [2019-11-25 08:45:24,253 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/28df11596/3a9a15de50fe4f11ad57b1312e6b4fd3 [2019-11-25 08:45:24,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:24,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:24,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:24,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:24,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272bfaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24, skipping insertion in model container [2019-11-25 08:45:24,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:24,290 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:24,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,572 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:24,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,618 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:24,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24 WrapperNode [2019-11-25 08:45:24,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:24,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:24,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:24,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:24,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:24,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:24,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:24,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:45:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-25 08:45:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:24,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:45:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:45:25,275 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:25,275 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-25 08:45:25,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25 BoogieIcfgContainer [2019-11-25 08:45:25,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:25,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:45:25,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:45:25,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:45:25,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:45:24" (1/3) ... [2019-11-25 08:45:25,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a868408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (2/3) ... [2019-11-25 08:45:25,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a868408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/3) ... [2019-11-25 08:45:25,283 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-25 08:45:25,292 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:45:25,299 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-25 08:45:25,309 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-25 08:45:25,338 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:45:25,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:45:25,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:45:25,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:25,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:25,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:45:25,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:25,339 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:45:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-25 08:45:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:45:25,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,358 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-25 08:45:25,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988137047] [2019-11-25 08:45:25,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,508 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-25 08:45:25,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988137047] [2019-11-25 08:45:25,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:25,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469449223] [2019-11-25 08:45:25,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:25,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:25,531 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-25 08:45:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:25,632 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-25 08:45:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:25,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-25 08:45:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:25,643 INFO L225 Difference]: With dead ends: 90 [2019-11-25 08:45:25,643 INFO L226 Difference]: Without dead ends: 50 [2019-11-25 08:45:25,646 INFO L630 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-25 08:45:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-25 08:45:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-25 08:45:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-25 08:45:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-25 08:45:25,682 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-25 08:45:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:25,683 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-25 08:45:25,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-25 08:45:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:45:25,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,685 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-25 08:45:25,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248795333] [2019-11-25 08:45:25,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,766 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-25 08:45:25,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248795333] [2019-11-25 08:45:25,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:25,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441597521] [2019-11-25 08:45:25,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:25,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:25,769 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-25 08:45:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:25,830 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-25 08:45:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:25,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 08:45:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:25,832 INFO L225 Difference]: With dead ends: 77 [2019-11-25 08:45:25,832 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 08:45:25,833 INFO L630 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-25 08:45:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 08:45:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-25 08:45:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 08:45:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-25 08:45:25,840 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-25 08:45:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:25,841 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-25 08:45:25,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-25 08:45:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:45:25,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,842 INFO L410 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-25 08:45:25,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-25 08:45:25,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569999533] [2019-11-25 08:45:25,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,912 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-25 08:45:25,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569999533] [2019-11-25 08:45:25,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:25,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064168698] [2019-11-25 08:45:25,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:25,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:25,914 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-25 08:45:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:25,939 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-25 08:45:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:25,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-25 08:45:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:25,941 INFO L225 Difference]: With dead ends: 50 [2019-11-25 08:45:25,941 INFO L226 Difference]: Without dead ends: 48 [2019-11-25 08:45:25,942 INFO L630 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-25 08:45:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-25 08:45:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-25 08:45:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-25 08:45:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-25 08:45:25,947 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-25 08:45:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:25,948 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-25 08:45:25,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-25 08:45:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:45:25,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,949 INFO L410 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-25 08:45:25,949 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-25 08:45:25,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580491908] [2019-11-25 08:45:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:26,067 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:45:26,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:45:26 BoogieIcfgContainer [2019-11-25 08:45:26,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:45:26,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:26,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:26,099 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:26,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/4) ... [2019-11-25 08:45:26,104 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:45:26,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:26,106 INFO L168 Benchmark]: Toolchain (without parser) took 1848.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -86.8 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:26,107 INFO L168 Benchmark]: CDTParser took 0.22 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-25 08:45:26,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:26,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.40 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-25 08:45:26,110 INFO L168 Benchmark]: Boogie Preprocessor took 41.09 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-25 08:45:26,111 INFO L168 Benchmark]: RCFGBuilder took 558.08 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.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:26,112 INFO L168 Benchmark]: TraceAbstraction took 820.94 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: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:26,113 INFO L168 Benchmark]: Witness Printer took 5.62 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-25 08:45:26,117 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.22 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 361.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.40 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. * Boogie Preprocessor took 41.09 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. * RCFGBuilder took 558.08 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.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 820.94 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: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.62 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.1s 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-6b5699a [2019-11-25 08:45:28,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:28,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:28,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:28,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:28,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:28,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:28,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:28,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:28,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:28,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:28,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:28,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:28,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:28,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:28,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:28,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:28,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:28,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:28,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:28,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:28,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:28,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:28,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:28,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:28,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:28,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:28,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:28,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:28,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:28,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:28,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:28,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:28,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:28,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:28,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:28,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:28,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:28,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:28,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:28,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:28,162 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:45:28,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:28,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:28,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:28,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:28,177 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:28,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:28,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:28,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:28,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:28,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:28,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:28,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:28,180 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:45:28,180 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:45:28,180 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:45:28,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:28,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:28,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:28,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:28,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:28,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:28,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:28,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:28,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:28,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:28,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:28,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:28,184 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:45:28,184 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:45:28,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:28,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:45:28,185 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_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:28,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:28,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:28,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:28,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:28,453 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:28,454 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-25 08:45:28,514 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/ce64af5cf/3d8f94c03fd84adabb5b9a2a9f17b2fb/FLAG889f87d12 [2019-11-25 08:45:28,942 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:28,943 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-25 08:45:28,949 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/ce64af5cf/3d8f94c03fd84adabb5b9a2a9f17b2fb/FLAG889f87d12 [2019-11-25 08:45:29,358 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/data/ce64af5cf/3d8f94c03fd84adabb5b9a2a9f17b2fb [2019-11-25 08:45:29,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:29,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:29,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:29,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:29,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:29,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7890b756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29, skipping insertion in model container [2019-11-25 08:45:29,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:29,397 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:29,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:29,591 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:29,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:29,721 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:29,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29 WrapperNode [2019-11-25 08:45:29,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:29,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:29,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:29,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:29,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:29,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:29,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:29,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:29,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... [2019-11-25 08:45:29,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:29,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:29,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:29,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:29,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:29,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:45:29,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:45:29,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:29,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:29,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-25 08:45:29,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:45:30,392 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:30,392 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-25 08:45:30,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:30 BoogieIcfgContainer [2019-11-25 08:45:30,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:30,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:45:30,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:45:30,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:45:30,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:45:29" (1/3) ... [2019-11-25 08:45:30,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3fc919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:30, skipping insertion in model container [2019-11-25 08:45:30,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:29" (2/3) ... [2019-11-25 08:45:30,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3fc919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:30, skipping insertion in model container [2019-11-25 08:45:30,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:30" (3/3) ... [2019-11-25 08:45:30,400 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-25 08:45:30,409 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:45:30,416 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-25 08:45:30,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-25 08:45:30,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:45:30,447 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:45:30,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:45:30,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:30,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:30,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:45:30,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:30,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:45:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-25 08:45:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:45:30,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,468 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-25 08:45:30,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:30,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764626166] [2019-11-25 08:45:30,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 08:45:30,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:30,586 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-25 08:45:30,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:30,590 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-25 08:45:30,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764626166] [2019-11-25 08:45:30,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:45:30,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551258295] [2019-11-25 08:45:30,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:45:30,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:30,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:45:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:45:30,613 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-25 08:45:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,632 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-25 08:45:30,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:45:30,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-25 08:45:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,645 INFO L225 Difference]: With dead ends: 82 [2019-11-25 08:45:30,645 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 08:45:30,647 INFO L630 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-25 08:45:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 08:45:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-25 08:45:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 08:45:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-25 08:45:30,710 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-25 08:45:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,710 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-25 08:45:30,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:45:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-25 08:45:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:45:30,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 08:45:30,924 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-25 08:45:30,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:30,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298239665] [2019-11-25 08:45:30,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:31,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:31,050 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-25 08:45:31,050 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:31,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:31,058 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-25 08:45:31,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298239665] [2019-11-25 08:45:31,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 08:45:31,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10047118] [2019-11-25 08:45:31,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:31,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:31,061 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-25 08:45:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,123 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-25 08:45:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:31,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-25 08:45:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,129 INFO L225 Difference]: With dead ends: 82 [2019-11-25 08:45:31,129 INFO L226 Difference]: Without dead ends: 50 [2019-11-25 08:45:31,130 INFO L630 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-25 08:45:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-25 08:45:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-25 08:45:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-25 08:45:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-25 08:45:31,138 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-25 08:45:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,138 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-25 08:45:31,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-25 08:45:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:45:31,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 08:45:31,340 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,340 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-25 08:45:31,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:31,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567909604] [2019-11-25 08:45:31,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:31,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:31,445 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-25 08:45:31,445 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:31,470 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-25 08:45:31,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567909604] [2019-11-25 08:45:31,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:45:31,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746145200] [2019-11-25 08:45:31,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:45:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:45:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:45:31,472 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-25 08:45:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,596 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-25 08:45:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:45:31,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-25 08:45:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,598 INFO L225 Difference]: With dead ends: 96 [2019-11-25 08:45:31,598 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 08:45:31,599 INFO L630 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-25 08:45:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 08:45:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-25 08:45:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 08:45:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-25 08:45:31,608 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-25 08:45:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,608 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-25 08:45:31,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:45:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-25 08:45:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:45:31,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,610 INFO L410 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-25 08:45:31,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 08:45:31,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-25 08:45:31,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:31,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162362787] [2019-11-25 08:45:31,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:45:31,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:31,988 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-25 08:45:31,989 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:31,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:32,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:32,068 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-25 08:45:32,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162362787] [2019-11-25 08:45:32,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-25 08:45:32,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748186562] [2019-11-25 08:45:32,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:45:32,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:45:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:45:32,070 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-25 08:45:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,629 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-11-25 08:45:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:45:34,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-25 08:45:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,631 INFO L225 Difference]: With dead ends: 146 [2019-11-25 08:45:34,631 INFO L226 Difference]: Without dead ends: 137 [2019-11-25 08:45:34,632 INFO L630 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-25 08:45:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-25 08:45:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-11-25 08:45:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 08:45:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-25 08:45:34,655 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-25 08:45:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,657 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-25 08:45:34,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:45:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-25 08:45:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:45:34,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,659 INFO L410 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-25 08:45:34,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 08:45:34,869 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-25 08:45:34,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:34,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001429696] [2019-11-25 08:45:34,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:45:34,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:34,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:34,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,124 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-25 08:45:35,125 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:35,264 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-25 08:45:35,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001429696] [2019-11-25 08:45:35,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:35,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-25 08:45:35,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006085578] [2019-11-25 08:45:35,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 08:45:35,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:45:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:45:35,267 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-25 08:45:36,161 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-11-25 08:45:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:36,321 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-25 08:45:36,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:45:36,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-25 08:45:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:36,324 INFO L225 Difference]: With dead ends: 180 [2019-11-25 08:45:36,325 INFO L226 Difference]: Without dead ends: 178 [2019-11-25 08:45:36,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-25 08:45:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-25 08:45:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-25 08:45:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:45:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-25 08:45:36,341 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-25 08:45:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:36,342 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-25 08:45:36,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 08:45:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-25 08:45:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:45:36,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:36,343 INFO L410 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-25 08:45:36,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 08:45:36,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-25 08:45:36,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:36,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167052218] [2019-11-25 08:45:36,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:45:36,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,684 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-25 08:45:36,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:36,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:36,763 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-25 08:45:36,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167052218] [2019-11-25 08:45:36,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:36,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-25 08:45:36,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032209209] [2019-11-25 08:45:36,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:45:36,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:45:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:45:36,764 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-25 08:45:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,317 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-25 08:45:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:45:37,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-25 08:45:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,319 INFO L225 Difference]: With dead ends: 166 [2019-11-25 08:45:37,319 INFO L226 Difference]: Without dead ends: 131 [2019-11-25 08:45:37,320 INFO L630 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-25 08:45:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-25 08:45:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-25 08:45:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:45:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-25 08:45:37,342 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-25 08:45:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,343 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-25 08:45:37,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:45:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-25 08:45:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:45:37,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,349 INFO L410 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-25 08:45:37,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 08:45:37,571 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-25 08:45:37,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:37,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025004139] [2019-11-25 08:45:37,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:37,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:37,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:37,669 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-25 08:45:37,669 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:37,684 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-25 08:45:37,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025004139] [2019-11-25 08:45:37,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:37,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:45:37,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210919686] [2019-11-25 08:45:37,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:45:37,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:45:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:45:37,686 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-25 08:45:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,784 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-25 08:45:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:45:37,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-25 08:45:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,787 INFO L225 Difference]: With dead ends: 157 [2019-11-25 08:45:37,787 INFO L226 Difference]: Without dead ends: 141 [2019-11-25 08:45:37,790 INFO L630 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-25 08:45:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-25 08:45:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-25 08:45:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-25 08:45:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-25 08:45:37,809 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-25 08:45:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,809 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-25 08:45:37,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:45:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-25 08:45:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:45:37,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,811 INFO L410 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-25 08:45:38,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 08:45:38,032 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-25 08:45:38,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:38,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254264313] [2019-11-25 08:45:38,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,119 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-25 08:45:38,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:38,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-25 08:45:38,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254264313] [2019-11-25 08:45:38,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:38,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:45:38,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562158605] [2019-11-25 08:45:38,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:38,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,122 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-25 08:45:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,150 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-25 08:45:38,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:38,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:45:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,151 INFO L225 Difference]: With dead ends: 96 [2019-11-25 08:45:38,151 INFO L226 Difference]: Without dead ends: 94 [2019-11-25 08:45:38,152 INFO L630 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-25 08:45:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-25 08:45:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-25 08:45:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-25 08:45:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-25 08:45:38,167 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-25 08:45:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,167 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-25 08:45:38,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-25 08:45:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:45:38,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,169 INFO L410 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-25 08:45:38,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 08:45:38,384 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-25 08:45:38,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:38,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035251526] [2019-11-25 08:45:38,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,516 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-25 08:45:38,517 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:38,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:38,584 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-25 08:45:38,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035251526] [2019-11-25 08:45:38,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:38,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-25 08:45:38,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827272579] [2019-11-25 08:45:38,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:45:38,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:45:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:45:38,586 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-25 08:45:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,981 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-25 08:45:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:45:38,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-25 08:45:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,982 INFO L225 Difference]: With dead ends: 131 [2019-11-25 08:45:38,982 INFO L226 Difference]: Without dead ends: 118 [2019-11-25 08:45:38,983 INFO L630 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-25 08:45:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-25 08:45:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-25 08:45:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:45:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-25 08:45:38,991 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-25 08:45:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,991 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-25 08:45:38,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:45:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-25 08:45:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:45:38,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,993 INFO L410 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-25 08:45:39,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 08:45:39,206 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-25 08:45:39,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:39,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371537939] [2019-11-25 08:45:39,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:39,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 08:45:39,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:39,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:39,332 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-25 08:45:39,333 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:39,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:39,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:39,404 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-25 08:45:39,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371537939] [2019-11-25 08:45:39,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:39,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-25 08:45:39,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944996493] [2019-11-25 08:45:39,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:45:39,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:39,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:45:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:45:39,406 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-25 08:45:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:39,751 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-25 08:45:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:45:39,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-25 08:45:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:39,752 INFO L225 Difference]: With dead ends: 114 [2019-11-25 08:45:39,752 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 08:45:39,753 INFO L630 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-25 08:45:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 08:45:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-25 08:45:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 08:45:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-25 08:45:39,759 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-25 08:45:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:39,763 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-25 08:45:39,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:45:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-25 08:45:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:45:39,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:39,765 INFO L410 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-25 08:45:39,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 08:45:39,965 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-25 08:45:39,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:39,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468302327] [2019-11-25 08:45:39,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:40,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:45:40,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:40,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,107 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-25 08:45:40,107 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:40,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,159 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-25 08:45:40,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468302327] [2019-11-25 08:45:40,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:40,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-25 08:45:40,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356716969] [2019-11-25 08:45:40,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:45:40,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:45:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:45:40,161 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-25 08:45:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:40,399 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-25 08:45:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:45:40,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-25 08:45:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:40,401 INFO L225 Difference]: With dead ends: 84 [2019-11-25 08:45:40,401 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:45:40,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:45:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:45:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-25 08:45:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:45:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-25 08:45:40,410 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-25 08:45:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:40,410 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-25 08:45:40,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:45:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-25 08:45:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:45:40,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:40,413 INFO L410 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-25 08:45:40,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 08:45:40,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-25 08:45:40,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:40,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993796709] [2019-11-25 08:45:40,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:40,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:45:40,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:40,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:40,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-25 08:45:40,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:40,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:41,055 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-25 08:45:41,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993796709] [2019-11-25 08:45:41,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:41,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-25 08:45:41,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659044600] [2019-11-25 08:45:41,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:45:41,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:45:41,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:45:41,057 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-25 08:45:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:41,403 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-25 08:45:41,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:45:41,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-25 08:45:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:41,405 INFO L225 Difference]: With dead ends: 82 [2019-11-25 08:45:41,405 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:45:41,405 INFO L630 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-25 08:45:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:45:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-25 08:45:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:45:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-25 08:45:41,412 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-25 08:45:41,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:41,412 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-25 08:45:41,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:45:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-25 08:45:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:45:41,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:41,413 INFO L410 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-25 08:45:41,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 08:45:41,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-25 08:45:41,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:41,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115272444] [2019-11-25 08:45:41,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:41,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:45:41,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:41,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:41,804 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-25 08:45:41,804 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:41,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:42,036 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-25 08:45:42,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115272444] [2019-11-25 08:45:42,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:42,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-25 08:45:42,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22937173] [2019-11-25 08:45:42,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 08:45:42,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:45:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:45:42,038 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-25 08:45:42,799 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-11-25 08:45:43,048 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-11-25 08:45:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:43,651 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-25 08:45:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:45:43,651 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-25 08:45:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:43,652 INFO L225 Difference]: With dead ends: 154 [2019-11-25 08:45:43,652 INFO L226 Difference]: Without dead ends: 134 [2019-11-25 08:45:43,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-25 08:45:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-25 08:45:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-25 08:45:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 08:45:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-25 08:45:43,659 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-25 08:45:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:43,659 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-25 08:45:43,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 08:45:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-25 08:45:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:45:43,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:43,660 INFO L410 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-25 08:45:43,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 08:45:43,861 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:43,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-25 08:45:43,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:43,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733083949] [2019-11-25 08:45:43,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:43,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:45:43,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:43,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:43,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:44,237 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-25 08:45:44,243 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-25 08:45:44,243 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:44,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:44,425 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-25 08:45:44,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733083949] [2019-11-25 08:45:44,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:44,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-25 08:45:44,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752435005] [2019-11-25 08:45:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 08:45:44,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:45:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:45:44,426 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-25 08:45:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:46,407 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-25 08:45:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-25 08:45:46,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-25 08:45:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:46,408 INFO L225 Difference]: With dead ends: 195 [2019-11-25 08:45:46,408 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:45:46,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-25 08:45:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:45:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-25 08:45:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 08:45:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-25 08:45:46,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-25 08:45:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:46,415 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-25 08:45:46,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 08:45:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-25 08:45:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:45:46,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:46,416 INFO L410 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-25 08:45:46,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 08:45:46,616 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-25 08:45:46,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:46,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623952380] [2019-11-25 08:45:46,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:46,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 08:45:46,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:46,894 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-25 08:45:46,894 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:47,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:47,037 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-25 08:45:47,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623952380] [2019-11-25 08:45:47,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:47,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-25 08:45:47,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776491086] [2019-11-25 08:45:47,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:45:47,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:45:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:45:47,038 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-25 08:45:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:47,959 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-25 08:45:47,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 08:45:47,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-25 08:45:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:47,961 INFO L225 Difference]: With dead ends: 125 [2019-11-25 08:45:47,961 INFO L226 Difference]: Without dead ends: 101 [2019-11-25 08:45:47,962 INFO L630 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-25 08:45:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-25 08:45:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-25 08:45:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-25 08:45:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-25 08:45:47,966 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-25 08:45:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:47,966 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-25 08:45:47,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:45:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-25 08:45:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:45:47,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:47,967 INFO L410 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-25 08:45:48,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 08:45:48,181 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-25 08:45:48,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:48,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795602328] [2019-11-25 08:45:48,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:48,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:45:48,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:48,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:48,315 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-25 08:45:48,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:48,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:48,520 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-25 08:45:48,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795602328] [2019-11-25 08:45:48,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:48,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-25 08:45:48,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446380882] [2019-11-25 08:45:48,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:45:48,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:48,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:45:48,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:45:48,521 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-25 08:45:48,886 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-25 08:45:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:49,019 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-25 08:45:49,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:45:49,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-25 08:45:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:49,020 INFO L225 Difference]: With dead ends: 52 [2019-11-25 08:45:49,020 INFO L226 Difference]: Without dead ends: 41 [2019-11-25 08:45:49,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:45:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-25 08:45:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-25 08:45:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-25 08:45:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-25 08:45:49,025 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-25 08:45:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:49,025 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-25 08:45:49,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:45:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-25 08:45:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:45:49,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:49,026 INFO L410 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-25 08:45:49,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 08:45:49,226 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-25 08:45:49,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:49,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750648683] [2019-11-25 08:45:49,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:49,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:45:49,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:49,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:49,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:49,383 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-25 08:45:49,384 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:49,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:49,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:49,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:49,505 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-25 08:45:49,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750648683] [2019-11-25 08:45:49,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:49,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-25 08:45:49,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593602384] [2019-11-25 08:45:49,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:45:49,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:49,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:45:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:45:49,507 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-25 08:45:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:50,949 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-25 08:45:50,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:45:50,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-25 08:45:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:50,950 INFO L225 Difference]: With dead ends: 55 [2019-11-25 08:45:50,950 INFO L226 Difference]: Without dead ends: 41 [2019-11-25 08:45:50,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:45:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-25 08:45:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-25 08:45:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:45:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-25 08:45:50,955 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-25 08:45:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:50,955 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-25 08:45:50,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:45:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-25 08:45:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 08:45:50,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:50,956 INFO L410 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-25 08:45:51,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-25 08:45:51,157 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-25 08:45:51,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:51,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909334149] [2019-11-25 08:45:51,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:51,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:45:51,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:51,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:51,303 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-25 08:45:51,303 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:51,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:45:51,421 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-25 08:45:51,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909334149] [2019-11-25 08:45:51,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:51,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-25 08:45:51,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467183386] [2019-11-25 08:45:51,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:45:51,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:51,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:45:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:45:51,423 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-25 08:45:52,410 WARN L192 SmtUtils]: Spent 931.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-25 08:45:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:52,743 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-25 08:45:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:45:52,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-25 08:45:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:52,744 INFO L225 Difference]: With dead ends: 79 [2019-11-25 08:45:52,744 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 08:45:52,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:45:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 08:45:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-25 08:45:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:45:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-25 08:45:52,749 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-25 08:45:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:52,749 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-25 08:45:52,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:45:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-25 08:45:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:45:52,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:52,750 INFO L410 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-25 08:45:52,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-25 08:45:52,950 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:52,951 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-25 08:45:52,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:45:52,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809677271] [2019-11-25 08:45:52,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/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-25 08:45:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:53,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:53,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:53,043 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-25 08:45:53,043 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:45:53,044 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-25 08:45:53,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809677271] [2019-11-25 08:45:53,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:53,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 08:45:53,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185734381] [2019-11-25 08:45:53,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:53,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:45:53,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:53,046 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-25 08:45:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:53,074 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-25 08:45:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:53,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-25 08:45:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:53,074 INFO L225 Difference]: With dead ends: 39 [2019-11-25 08:45:53,075 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:45:53,075 INFO L630 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-25 08:45:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:45:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:45:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:45:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:45:53,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-25 08:45:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:53,075 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:45:53,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:45:53,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:45:53,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-25 08:45:53,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:45:53,520 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-11-25 08:45:53,645 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 135 [2019-11-25 08:45:54,498 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-25 08:45:55,330 WARN L192 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-11-25 08:45:55,836 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-25 08:45:56,145 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-25 08:45:56,383 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-11-25 08:45:56,916 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-25 08:45:57,317 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-11-25 08:45:57,800 WARN L192 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2019-11-25 08:45:58,002 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:45:58,031 INFO L447 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L440 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 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (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|)))) [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L444 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-25 08:45:58,032 INFO L440 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 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1) (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-25 08:45:58,033 INFO L444 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-25 08:45:58,033 INFO L440 ceAbstractionStarter]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= 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))) .cse1 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse2) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-25 08:45:58,033 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:45:58,033 INFO L440 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 .cse0 .cse1 .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (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 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (not .cse3) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-11-25 08:45:58,033 INFO L440 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-25 08:45:58,033 INFO L440 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-25 08:45:58,033 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-11-25 08:45:58,033 INFO L440 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 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (not .cse0)))) [2019-11-25 08:45:58,033 INFO L440 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-25 08:45:58,033 INFO L440 ceAbstractionStarter]: At program point L57-4(line 57) the Hoare annotation is: (let ((.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))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (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 .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 .cse3 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (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)) (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 (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 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-11-25 08:45:58,034 INFO L440 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (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|) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) |ULTIMATE.start_main_#t~short19| (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)) .cse1 .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-11-25 08:45:58,034 INFO L440 ceAbstractionStarter]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (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))))) [2019-11-25 08:45:58,034 INFO L440 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-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-11-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-25 08:45:58,034 INFO L440 ceAbstractionStarter]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (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)))) (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 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse2) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (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 ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-25 08:45:58,034 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-25 08:45:58,035 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-25 08:45:58,035 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-25 08:45:58,035 INFO L444 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-25 08:45:58,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:45:58 BoogieIcfgContainer [2019-11-25 08:45:58,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:45:58,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:58,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:58,059 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:58,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:30" (3/4) ... [2019-11-25 08:45:58,063 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:45:58,075 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-25 08:45:58,075 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-25 08:45:58,076 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:45:58,100 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-25 08:45:58,100 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-25 08:45:58,101 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) || ((((1bv32 == \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) && !~fp.eq~FLOAT(x, x)) [2019-11-25 08:45:58,101 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-25 08:45:58,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-25 08:45:58,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-25 08:45:58,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((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))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~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-25 08:45:58,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~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-25 08:45:58,103 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)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~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])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-11-25 08:45:58,103 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~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)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-11-25 08:45:58,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) [2019-11-25 08:45:58,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~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]))) [2019-11-25 08:45:58,104 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-25 08:45:58,148 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_64b802b1-c6c5-444d-bf2a-f29ee1694893/bin/uautomizer/witness.graphml [2019-11-25 08:45:58,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:58,150 INFO L168 Benchmark]: Toolchain (without parser) took 28788.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.3 MB). Free memory was 955.1 MB in the beginning and 1.0 GB in the end (delta: -61.1 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:58,150 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:58,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -207.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:58,151 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:58,151 INFO L168 Benchmark]: Boogie Preprocessor took 59.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:58,151 INFO L168 Benchmark]: RCFGBuilder took 537.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:58,152 INFO L168 Benchmark]: TraceAbstraction took 27664.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.1 MB). Peak memory consumption was 398.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:58,152 INFO L168 Benchmark]: Witness Printer took 89.93 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:58,154 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -207.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 537.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27664.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.1 MB). Peak memory consumption was 398.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.93 ms. Allocated memory is still 1.4 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: - 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: (((((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))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~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) && 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: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~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]))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~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 && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~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)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - 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)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~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])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - 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) || ((((1bv32 == \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) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~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: (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: 27.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 1147 SDtfs, 2730 SDslu, 4439 SDs, 0 SdLazy, 1925 SolverSat, 267 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.9s 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 605 HoareAnnotationTreeSize, 14 FomulaSimplifications, 572522 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 62940 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93581 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 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...