./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ............................................................................................................................................................................................................................................................................................................................................................................ 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/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:27,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:27,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:27,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:27,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:27,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:27,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:27,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:27,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:27,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:27,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:27,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:27,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:27,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:27,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:27,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:27,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:27,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:27,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:27,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:27,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:27,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:27,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:27,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:27,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:27,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:27,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:27,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:27,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:27,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:27,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:27,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:27,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:27,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:27,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:27,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:27,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:27,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:27,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:27,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:27,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:27,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:56:27,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:27,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:27,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:27,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:27,687 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:27,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:27,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:27,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:27,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:27,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:27,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:56:27,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:27,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:27,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:56:27,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:56:27,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:27,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:27,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:56:27,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:56:27,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:27,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:56:27,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:56:27,692 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/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-10-22 08:56:27,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:27,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:27,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:27,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:27,741 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:27,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 08:56:27,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/405d34cdd/81c776311113437aa091f1b5572f8278/FLAG1af9656ed [2019-10-22 08:56:28,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:28,168 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 08:56:28,175 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/405d34cdd/81c776311113437aa091f1b5572f8278/FLAG1af9656ed [2019-10-22 08:56:28,185 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/405d34cdd/81c776311113437aa091f1b5572f8278 [2019-10-22 08:56:28,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:28,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:28,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:28,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:28,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:28,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0c5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28, skipping insertion in model container [2019-10-22 08:56:28,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,202 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:28,217 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:28,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:28,406 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:28,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:28,450 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:28,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28 WrapperNode [2019-10-22 08:56:28,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:28,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:28,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:28,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:28,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:28,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:28,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:28,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:28,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... [2019-10-22 08:56:28,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:28,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:28,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:28,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:28,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-22 08:56:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:28,981 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:28,982 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 08:56:28,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:28 BoogieIcfgContainer [2019-10-22 08:56:28,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:28,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:56:28,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:56:28,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:56:28,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:56:28" (1/3) ... [2019-10-22 08:56:28,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c00ad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:28, skipping insertion in model container [2019-10-22 08:56:28,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:28" (2/3) ... [2019-10-22 08:56:28,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c00ad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:28, skipping insertion in model container [2019-10-22 08:56:28,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:28" (3/3) ... [2019-10-22 08:56:28,990 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-10-22 08:56:29,002 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:56:29,010 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:56:29,022 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:56:29,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:56:29,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:56:29,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:56:29,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:29,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:29,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:56:29,047 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:29,047 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:56:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 08:56:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:56:29,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,073 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,075 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-10-22 08:56:29,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387349757] [2019-10-22 08:56:29,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:29,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387349757] [2019-10-22 08:56:29,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:29,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:29,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481465530] [2019-10-22 08:56:29,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:29,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:29,247 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-10-22 08:56:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:29,336 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-10-22 08:56:29,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:29,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 08:56:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:29,347 INFO L225 Difference]: With dead ends: 90 [2019-10-22 08:56:29,347 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 08:56:29,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 08:56:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 08:56:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:56:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-10-22 08:56:29,384 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-10-22 08:56:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:29,384 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-10-22 08:56:29,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-10-22 08:56:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:56:29,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-10-22 08:56:29,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384273603] [2019-10-22 08:56:29,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:29,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384273603] [2019-10-22 08:56:29,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:29,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:29,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234453465] [2019-10-22 08:56:29,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:29,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:29,444 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-10-22 08:56:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:29,483 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-10-22 08:56:29,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:29,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 08:56:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:29,485 INFO L225 Difference]: With dead ends: 77 [2019-10-22 08:56:29,485 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 08:56:29,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 08:56:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-10-22 08:56:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:56:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 08:56:29,492 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-10-22 08:56:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:29,492 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:56:29,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-10-22 08:56:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:56:29,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,493 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-10-22 08:56:29,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482209747] [2019-10-22 08:56:29,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:29,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482209747] [2019-10-22 08:56:29,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:29,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:29,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527263923] [2019-10-22 08:56:29,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:29,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:29,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:29,541 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-10-22 08:56:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:29,569 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-10-22 08:56:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:29,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:56:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:29,572 INFO L225 Difference]: With dead ends: 50 [2019-10-22 08:56:29,572 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 08:56:29,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 08:56:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-22 08:56:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:56:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-10-22 08:56:29,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-10-22 08:56:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:29,578 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-10-22 08:56:29,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-10-22 08:56:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:56:29,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,591 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-10-22 08:56:29,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737904769] [2019-10-22 08:56:29,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:29,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:29,733 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:56:29,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:29 BoogieIcfgContainer [2019-10-22 08:56:29,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:29,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:29,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:29,760 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:29,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:28" (3/4) ... [2019-10-22 08:56:29,763 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:29,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:29,765 INFO L168 Benchmark]: Toolchain (without parser) took 1576.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -111.8 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:29,766 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:29,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:29,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.49 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-10-22 08:56:29,767 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:29,768 INFO L168 Benchmark]: RCFGBuilder took 463.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:29,768 INFO L168 Benchmark]: TraceAbstraction took 775.80 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:29,768 INFO L168 Benchmark]: Witness Printer took 3.83 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-10-22 08:56:29,771 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.49 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 27.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 463.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 775.80 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L21] __uint32_t w; [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; [L70] float res = fmax_float(x, y); [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __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.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:31,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:31,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:31,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:31,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:31,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:31,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:31,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:31,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:31,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:31,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:31,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:31,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:31,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:31,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:31,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:31,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:31,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:31,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:31,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:31,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:31,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:31,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:31,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:31,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:31,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:31,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:31,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:31,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:31,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:31,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:31,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:31,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:31,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:31,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:31,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:31,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:31,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:31,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:31,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:31,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:31,765 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 08:56:31,777 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:31,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:31,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:31,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:31,778 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:31,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:31,779 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:31,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:31,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:31,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:56:31,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:56:31,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:56:31,780 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 08:56:31,780 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 08:56:31,780 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:31,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:31,780 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:31,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:56:31,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:31,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:31,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:56:31,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:56:31,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:31,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:31,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:56:31,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:56:31,782 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 08:56:31,782 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 08:56:31,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:56:31,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:56:31,782 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/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-10-22 08:56:31,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:31,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:31,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:31,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:31,839 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:31,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 08:56:31,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/509124661/6722fe0060224640b873f5c2f18a0c5e/FLAGaec305edc [2019-10-22 08:56:32,253 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:32,254 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 08:56:32,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/509124661/6722fe0060224640b873f5c2f18a0c5e/FLAGaec305edc [2019-10-22 08:56:32,271 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/data/509124661/6722fe0060224640b873f5c2f18a0c5e [2019-10-22 08:56:32,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:32,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:32,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:32,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:32,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:32,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b4998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32, skipping insertion in model container [2019-10-22 08:56:32,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,289 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:32,308 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:32,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:32,504 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:32,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:32,560 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:32,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32 WrapperNode [2019-10-22 08:56:32,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:32,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:32,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:32,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:32,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:32,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:32,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:32,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:32,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:32,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:32,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:32,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:32,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 08:56:32,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-10-22 08:56:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:33,189 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:33,189 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 08:56:33,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:33 BoogieIcfgContainer [2019-10-22 08:56:33,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:33,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:56:33,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:56:33,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:56:33,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:56:32" (1/3) ... [2019-10-22 08:56:33,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba09649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:33, skipping insertion in model container [2019-10-22 08:56:33,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (2/3) ... [2019-10-22 08:56:33,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba09649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:33, skipping insertion in model container [2019-10-22 08:56:33,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:33" (3/3) ... [2019-10-22 08:56:33,200 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-10-22 08:56:33,208 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:56:33,214 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:56:33,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:56:33,244 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:56:33,244 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:56:33,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:56:33,244 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:33,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:33,245 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:56:33,245 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:33,245 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:56:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 08:56:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:56:33,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:33,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:33,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-10-22 08:56:33,273 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:33,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858771519] [2019-10-22 08:56:33,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 08:56:33,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,359 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858771519] [2019-10-22 08:56:33,364 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:33,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 08:56:33,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52432307] [2019-10-22 08:56:33,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:56:33,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:56:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:33,382 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 08:56:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:33,400 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-10-22 08:56:33,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:56:33,402 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 08:56:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:33,411 INFO L225 Difference]: With dead ends: 82 [2019-10-22 08:56:33,411 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 08:56:33,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 08:56:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 08:56:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:56:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-10-22 08:56:33,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-10-22 08:56:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:33,447 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-10-22 08:56:33,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:56:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-10-22 08:56:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:56:33,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:33,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:33,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-10-22 08:56:33,649 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-10-22 08:56:33,650 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:33,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286373095] [2019-10-22 08:56:33,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:33,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,748 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:33,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286373095] [2019-10-22 08:56:33,766 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:33,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 08:56:33,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113293779] [2019-10-22 08:56:33,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:33,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:33,769 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-10-22 08:56:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:33,847 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-10-22 08:56:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:33,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 08:56:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:33,848 INFO L225 Difference]: With dead ends: 82 [2019-10-22 08:56:33,849 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 08:56:33,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 08:56:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 08:56:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:56:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-10-22 08:56:33,856 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-10-22 08:56:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:33,856 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-10-22 08:56:33,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-10-22 08:56:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:56:33,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:33,857 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:34,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-10-22 08:56:34,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-10-22 08:56:34,059 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:34,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238675703] [2019-10-22 08:56:34,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,143 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238675703] [2019-10-22 08:56:34,162 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:34,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:56:34,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499495205] [2019-10-22 08:56:34,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:34,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:34,164 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-10-22 08:56:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:34,253 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-10-22 08:56:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:34,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 08:56:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:34,255 INFO L225 Difference]: With dead ends: 96 [2019-10-22 08:56:34,255 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:56:34,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:56:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-10-22 08:56:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:56:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 08:56:34,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-10-22 08:56:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:34,263 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:56:34,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-10-22 08:56:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:56:34,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:34,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:34,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-10-22 08:56:34,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-10-22 08:56:34,469 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:34,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832835804] [2019-10-22 08:56:34,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:34,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,625 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832835804] [2019-10-22 08:56:34,694 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:34,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-10-22 08:56:34,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968737825] [2019-10-22 08:56:34,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:56:34,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:34,697 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-10-22 08:56:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:35,117 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-10-22 08:56:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:56:35,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-22 08:56:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:35,119 INFO L225 Difference]: With dead ends: 149 [2019-10-22 08:56:35,119 INFO L226 Difference]: Without dead ends: 140 [2019-10-22 08:56:35,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-22 08:56:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-10-22 08:56:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 08:56:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-10-22 08:56:35,135 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-10-22 08:56:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:35,136 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-10-22 08:56:35,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:56:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-10-22 08:56:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:56:35,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:35,137 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:35,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-10-22 08:56:35,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-10-22 08:56:35,338 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:35,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890602279] [2019-10-22 08:56:35,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:35,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:35,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,549 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:35,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-10-22 08:56:35,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890602279] [2019-10-22 08:56:35,669 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:35,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-10-22 08:56:35,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610739746] [2019-10-22 08:56:35,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 08:56:35,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:56:35,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:35,671 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-10-22 08:56:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:36,539 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-10-22 08:56:36,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 08:56:36,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-10-22 08:56:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:36,544 INFO L225 Difference]: With dead ends: 180 [2019-10-22 08:56:36,544 INFO L226 Difference]: Without dead ends: 178 [2019-10-22 08:56:36,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-10-22 08:56:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-22 08:56:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-10-22 08:56:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:56:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-10-22 08:56:36,558 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-10-22 08:56:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:36,559 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-10-22 08:56:36,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 08:56:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-10-22 08:56:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:56:36,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:36,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:36,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-10-22 08:56:36,767 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-10-22 08:56:36,767 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:36,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735123187] [2019-10-22 08:56:36,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:36,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:36,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:36,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:36,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:36,873 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:36,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:36,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:36,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:36,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735123187] [2019-10-22 08:56:36,915 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:36,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-10-22 08:56:36,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783478804] [2019-10-22 08:56:36,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:56:36,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:36,917 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-10-22 08:56:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:37,244 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-10-22 08:56:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:37,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-22 08:56:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:37,245 INFO L225 Difference]: With dead ends: 166 [2019-10-22 08:56:37,245 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 08:56:37,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 08:56:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-10-22 08:56:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:56:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-10-22 08:56:37,265 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-10-22 08:56:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:37,265 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-10-22 08:56:37,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:56:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-10-22 08:56:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:56:37,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:37,266 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:37,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-10-22 08:56:37,467 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-10-22 08:56:37,467 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:37,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347626084] [2019-10-22 08:56:37,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:37,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:37,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:37,533 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:37,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347626084] [2019-10-22 08:56:37,542 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:37,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:56:37,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174958245] [2019-10-22 08:56:37,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:37,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:37,543 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-10-22 08:56:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:37,615 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-10-22 08:56:37,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:37,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 08:56:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:37,616 INFO L225 Difference]: With dead ends: 157 [2019-10-22 08:56:37,616 INFO L226 Difference]: Without dead ends: 141 [2019-10-22 08:56:37,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-22 08:56:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-10-22 08:56:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 08:56:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 08:56:37,624 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-10-22 08:56:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:37,624 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 08:56:37,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-10-22 08:56:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:56:37,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:37,625 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:37,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-10-22 08:56:37,836 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-10-22 08:56:37,837 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:37,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753845615] [2019-10-22 08:56:37,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:37,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:37,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:37,889 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:37,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753845615] [2019-10-22 08:56:37,892 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:37,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:56:37,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775526738] [2019-10-22 08:56:37,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:37,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:37,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:37,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:37,893 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-10-22 08:56:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:37,921 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-10-22 08:56:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:37,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:56:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:37,923 INFO L225 Difference]: With dead ends: 96 [2019-10-22 08:56:37,923 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 08:56:37,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 08:56:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-10-22 08:56:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 08:56:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 08:56:37,937 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-10-22 08:56:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:37,938 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 08:56:37,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-10-22 08:56:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:56:37,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:37,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:38,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-10-22 08:56:38,140 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-10-22 08:56:38,140 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:38,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056180106] [2019-10-22 08:56:38,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:38,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:38,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:38,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:38,273 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:38,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:38,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056180106] [2019-10-22 08:56:38,324 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:38,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-10-22 08:56:38,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305276260] [2019-10-22 08:56:38,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:56:38,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:38,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:38,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:38,326 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-10-22 08:56:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:38,614 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-10-22 08:56:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:56:38,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 08:56:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:38,615 INFO L225 Difference]: With dead ends: 131 [2019-10-22 08:56:38,616 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 08:56:38,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 08:56:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-10-22 08:56:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:56:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-10-22 08:56:38,622 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-10-22 08:56:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:38,622 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-10-22 08:56:38,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:56:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-10-22 08:56:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:56:38,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:38,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:38,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-10-22 08:56:38,824 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-10-22 08:56:38,825 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:38,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675240420] [2019-10-22 08:56:38,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:38,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:56:38,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:38,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:38,950 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:38,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:38,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:39,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675240420] [2019-10-22 08:56:39,007 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:39,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-10-22 08:56:39,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513637774] [2019-10-22 08:56:39,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:56:39,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:56:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:56:39,009 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-10-22 08:56:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:39,300 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-10-22 08:56:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:39,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-10-22 08:56:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:39,301 INFO L225 Difference]: With dead ends: 114 [2019-10-22 08:56:39,301 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 08:56:39,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:56:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 08:56:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-22 08:56:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 08:56:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-10-22 08:56:39,307 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-10-22 08:56:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:39,307 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-10-22 08:56:39,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:56:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-10-22 08:56:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:56:39,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:39,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:39,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-10-22 08:56:39,509 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-10-22 08:56:39,509 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:39,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855610690] [2019-10-22 08:56:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:39,611 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:39,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:39,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855610690] [2019-10-22 08:56:39,655 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:39,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-10-22 08:56:39,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149341125] [2019-10-22 08:56:39,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:56:39,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:39,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:39,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:39,656 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-10-22 08:56:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:39,929 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-10-22 08:56:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:39,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-22 08:56:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:39,930 INFO L225 Difference]: With dead ends: 84 [2019-10-22 08:56:39,930 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 08:56:39,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 08:56:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 08:56:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:56:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-10-22 08:56:39,935 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-10-22 08:56:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:39,935 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-10-22 08:56:39,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:56:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-10-22 08:56:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:56:39,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:39,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:40,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-10-22 08:56:40,137 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-10-22 08:56:40,137 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:40,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172896166] [2019-10-22 08:56:40,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:40,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:40,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:40,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:40,259 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:40,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:40,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172896166] [2019-10-22 08:56:40,513 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:40,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-22 08:56:40,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980329103] [2019-10-22 08:56:40,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:56:40,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:40,514 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-10-22 08:56:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:40,831 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-10-22 08:56:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:56:40,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 08:56:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:40,832 INFO L225 Difference]: With dead ends: 82 [2019-10-22 08:56:40,833 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 08:56:40,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:56:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 08:56:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 08:56:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:56:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-10-22 08:56:40,838 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-10-22 08:56:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:40,838 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-10-22 08:56:40,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:56:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-10-22 08:56:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:56:40,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:40,841 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:41,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-10-22 08:56:41,047 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:41,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,047 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-10-22 08:56:41,048 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:41,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116616937] [2019-10-22 08:56:41,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:41,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:41,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:41,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:41,194 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:41,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116616937] [2019-10-22 08:56:41,358 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:41,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-10-22 08:56:41,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251694437] [2019-10-22 08:56:41,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 08:56:41,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:56:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:56:41,360 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-10-22 08:56:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:46,436 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2019-10-22 08:56:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:56:46,437 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-22 08:56:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:46,438 INFO L225 Difference]: With dead ends: 224 [2019-10-22 08:56:46,438 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 08:56:46,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-10-22 08:56:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 08:56:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 82. [2019-10-22 08:56:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 08:56:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-10-22 08:56:46,446 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 26 [2019-10-22 08:56:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:46,446 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-10-22 08:56:46,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 08:56:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-10-22 08:56:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:56:46,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:46,450 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:46,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-10-22 08:56:46,650 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-10-22 08:56:46,651 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:46,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618370204] [2019-10-22 08:56:46,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:46,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 08:56:46,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:46,981 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:47,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:47,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618370204] [2019-10-22 08:56:47,171 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:47,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-10-22 08:56:47,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341518320] [2019-10-22 08:56:47,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 08:56:47,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:56:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:47,171 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 15 states. [2019-10-22 08:56:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:49,322 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2019-10-22 08:56:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-22 08:56:49,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-22 08:56:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:49,323 INFO L225 Difference]: With dead ends: 245 [2019-10-22 08:56:49,323 INFO L226 Difference]: Without dead ends: 220 [2019-10-22 08:56:49,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2019-10-22 08:56:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-22 08:56:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 72. [2019-10-22 08:56:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 08:56:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-10-22 08:56:49,331 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 27 [2019-10-22 08:56:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:49,331 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-10-22 08:56:49,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 08:56:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-10-22 08:56:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:56:49,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:49,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:49,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-10-22 08:56:49,539 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-10-22 08:56:49,539 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:49,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728905089] [2019-10-22 08:56:49,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:49,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:56:49,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:49,777 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:49,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:49,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728905089] [2019-10-22 08:56:49,891 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:49,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-10-22 08:56:49,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263375212] [2019-10-22 08:56:49,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:56:49,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:56:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:49,892 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 12 states. [2019-10-22 08:56:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:51,124 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2019-10-22 08:56:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-22 08:56:51,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-22 08:56:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:51,125 INFO L225 Difference]: With dead ends: 187 [2019-10-22 08:56:51,125 INFO L226 Difference]: Without dead ends: 163 [2019-10-22 08:56:51,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-10-22 08:56:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-22 08:56:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 70. [2019-10-22 08:56:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 08:56:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-10-22 08:56:51,137 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2019-10-22 08:56:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:51,137 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-10-22 08:56:51,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:56:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-10-22 08:56:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:56:51,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:51,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:51,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-10-22 08:56:51,350 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1881082413, now seen corresponding path program 1 times [2019-10-22 08:56:51,351 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:51,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303440263] [2019-10-22 08:56:51,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:51,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:51,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:51,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,580 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:51,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303440263] [2019-10-22 08:56:51,712 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:51,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-10-22 08:56:51,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12473617] [2019-10-22 08:56:51,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 08:56:51,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:56:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:56:51,712 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 16 states. [2019-10-22 08:56:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:52,720 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-10-22 08:56:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:56:52,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-10-22 08:56:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:52,721 INFO L225 Difference]: With dead ends: 129 [2019-10-22 08:56:52,721 INFO L226 Difference]: Without dead ends: 91 [2019-10-22 08:56:52,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-10-22 08:56:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-22 08:56:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2019-10-22 08:56:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 08:56:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-22 08:56:52,726 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 29 [2019-10-22 08:56:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:52,726 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-22 08:56:52,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 08:56:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-22 08:56:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:56:52,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:52,727 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-10-22 08:56:52,927 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-10-22 08:56:52,928 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:52,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109820530] [2019-10-22 08:56:52,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:53,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:56:53,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:53,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:53,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:53,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,064 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:53,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109820530] [2019-10-22 08:56:53,224 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:53,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-22 08:56:53,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121295949] [2019-10-22 08:56:53,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:56:53,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:53,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:53,225 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-10-22 08:56:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:54,036 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-10-22 08:56:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:54,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-10-22 08:56:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:54,038 INFO L225 Difference]: With dead ends: 52 [2019-10-22 08:56:54,038 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:56:54,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:56:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 08:56:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 08:56:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-10-22 08:56:54,043 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-10-22 08:56:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:54,043 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-10-22 08:56:54,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:56:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-10-22 08:56:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:56:54,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:54,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:54,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-10-22 08:56:54,244 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-10-22 08:56:54,245 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:54,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787761178] [2019-10-22 08:56:54,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:54,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:56:54,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:54,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:54,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:54,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:54,365 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:54,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:54,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:54,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:54,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-10-22 08:56:54,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787761178] [2019-10-22 08:56:54,471 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:54,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-10-22 08:56:54,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766963028] [2019-10-22 08:56:54,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:56:54,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:56:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:56:54,472 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-10-22 08:56:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:54,956 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-10-22 08:56:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:56:54,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-22 08:56:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:54,957 INFO L225 Difference]: With dead ends: 55 [2019-10-22 08:56:54,957 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:56:54,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:56:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:56:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 08:56:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:56:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-22 08:56:54,961 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-10-22 08:56:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:54,962 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-22 08:56:54,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:56:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-22 08:56:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:56:54,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:54,963 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:55,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-10-22 08:56:55,171 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-10-22 08:56:55,171 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:55,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11835927] [2019-10-22 08:56:55,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/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-10-22 08:56:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:55,320 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:55,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:55,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11835927] [2019-10-22 08:56:55,428 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:55,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-10-22 08:56:55,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904980187] [2019-10-22 08:56:55,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:56:55,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:56:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:55,430 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-10-22 08:56:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:55,796 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-10-22 08:56:55,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:55,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-22 08:56:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:55,797 INFO L225 Difference]: With dead ends: 79 [2019-10-22 08:56:55,797 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 08:56:55,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:56:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 08:56:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-10-22 08:56:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:56:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-22 08:56:55,801 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-10-22 08:56:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:55,801 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-22 08:56:55,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:56:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-22 08:56:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:56:55,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:55,802 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:56,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-10-22 08:56:56,002 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-10-22 08:56:56,003 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:56,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880864488] [2019-10-22 08:56:56,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:56,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:56,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:56,091 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:56,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880864488] [2019-10-22 08:56:56,093 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:56,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 08:56:56,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978810510] [2019-10-22 08:56:56,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:56,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:56,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:56,095 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-10-22 08:56:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:56,124 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-22 08:56:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:56,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 08:56:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:56,125 INFO L225 Difference]: With dead ends: 39 [2019-10-22 08:56:56,125 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:56:56,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:56:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:56:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:56:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:56:56,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-10-22 08:56:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:56,126 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:56,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:56,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:56:56,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-10-22 08:56:56,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:56:56,570 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 84 [2019-10-22 08:56:56,685 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 115 [2019-10-22 08:56:57,071 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 79 [2019-10-22 08:56:57,672 WARN L191 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-10-22 08:56:58,308 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 25 [2019-10-22 08:56:58,563 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-10-22 08:56:58,793 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-10-22 08:56:59,100 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 34 [2019-10-22 08:56:59,393 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 32 [2019-10-22 08:56:59,983 WARN L191 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 36 [2019-10-22 08:57:00,227 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-10-22 08:57:00,372 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-10-22 08:57:00,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-10-22 08:57:00,440 INFO L446 ceAbstractionStarter]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-10-22 08:57:00,440 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-22 08:57:00,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:00,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:00,440 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-10-22 08:57:00,441 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-10-22 08:57:00,441 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-22 08:57:00,441 INFO L443 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55(line 55) 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-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-1(line 55) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short9| (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-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse0 (not |ULTIMATE.start_main_#t~short13|)) (.cse1 (not |ULTIMATE.start_main_#t~short9|))) (or (and .cse0 .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse2))) (and .cse2 .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-3(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short13|) (not |ULTIMATE.start_main_#t~short9|) (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~short12|) [2019-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-4(line 55) the Hoare annotation is: (let ((.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))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse4 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) .cse0 .cse1 (not (fp.eq .cse2 .cse2)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse3 .cse4 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)) (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 .cse3 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse4 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse1))) [2019-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-5(line 55) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_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 (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_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))) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (and |ULTIMATE.start_main_#t~short17| .cse2) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2))) [2019-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-6(line 55) the Hoare annotation is: (or (and (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (= ULTIMATE.start_fmax_float_~y 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))) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) [2019-10-22 08:57:00,441 INFO L439 ceAbstractionStarter]: At program point L55-7(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (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))) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-10-22 08:57:00,442 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))) (or (and (not .cse0) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-10-22 08:57:00,442 INFO L439 ceAbstractionStarter]: At program point L23-6(lines 23 27) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1) (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)))) [2019-10-22 08:57:00,442 INFO L443 ceAbstractionStarter]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L439 ceAbstractionStarter]: At program point L40(lines 20 41) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))) (or (and (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmax_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))) (and (not .cse0) (and (and (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))) (and (and (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) [2019-10-22 08:57:00,443 INFO L439 ceAbstractionStarter]: At program point L40-1(lines 20 41) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.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))) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and (= ULTIMATE.start_fmax_float_~y .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) .cse1 (not .cse2) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse3) (and (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq .cse0 .cse0)) .cse3 (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) .cse2))) [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-22 08:57:00,443 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-10-22 08:57:00,444 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 43 52) 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_fmax_float_~y)) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.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 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse3) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (and .cse0 .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-10-22 08:57:00,444 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-22 08:57:00,445 INFO L443 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-10-22 08:57:00,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:00 BoogieIcfgContainer [2019-10-22 08:57:00,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:00,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:00,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:00,469 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:00,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:33" (3/4) ... [2019-10-22 08:57:00,472 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:00,484 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-10-22 08:57:00,484 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 08:57:00,484 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:57:00,508 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-10-22 08:57:00,509 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-10-22 08:57:00,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((~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) [2019-10-22 08:57:00,509 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-10-22 08:57:00,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && y == y) || ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-10-22 08:57:00,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == x && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!~fp.eq~FLOAT(y, y) && (!(0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-10-22 08:57:00,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || (((((~fp.eq~FLOAT(x, x) && ~fp.eq~FLOAT(\result, x)) && y == y && y == x) && 1bv32 == \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-10-22 08:57:00,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) || (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-10-22 08:57:00,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res)) || (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) [2019-10-22 08:57:00,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && y == y) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((1bv32 == \result && y == y) && !~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 == x) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-10-22 08:57:00,511 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) [2019-10-22 08:57:00,511 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-10-22 08:57:00,511 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~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 == x) && !~fp.eq~FLOAT(x, x) [2019-10-22 08:57:00,536 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_57b40f0c-c10d-4f8a-81c5-006b0fbfc902/bin/uautomizer/witness.graphml [2019-10-22 08:57:00,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:00,538 INFO L168 Benchmark]: Toolchain (without parser) took 28263.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 952.3 MB in the beginning and 819.2 MB in the end (delta: 133.1 MB). Peak memory consumption was 444.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,538 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:00,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 940.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,539 INFO L168 Benchmark]: Boogie Preprocessor took 58.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,539 INFO L168 Benchmark]: RCFGBuilder took 474.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,539 INFO L168 Benchmark]: TraceAbstraction took 27274.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 819.2 MB in the end (delta: 245.5 MB). Peak memory consumption was 452.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,540 INFO L168 Benchmark]: Witness Printer took 68.18 ms. Allocated memory is still 1.3 GB. Free memory was 819.2 MB in the beginning and 819.2 MB in the end (delta: 64 B). Peak memory consumption was 64 B. Max. memory is 11.5 GB. [2019-10-22 08:57:00,541 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 940.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 474.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27274.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 819.2 MB in the end (delta: 245.5 MB). Peak memory consumption was 452.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.18 ms. Allocated memory is still 1.3 GB. Free memory was 819.2 MB in the beginning and 819.2 MB in the end (delta: 64 B). Peak memory consumption was 64 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || (((((~fp.eq~FLOAT(x, x) && ~fp.eq~FLOAT(\result, x)) && y == y && y == x) && 1bv32 == \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: 55]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~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 == x) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) || (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && y == y) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((1bv32 == \result && y == y) && !~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 == x) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((x == x && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!~fp.eq~FLOAT(y, y) && (!(0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res)) || (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) - InvariantResult [Line: 55]: 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: 55]: Loop Invariant Derived loop invariant: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((~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) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && y == y) || ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 55]: 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: 55]: 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.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 1236 SDtfs, 3202 SDslu, 4894 SDs, 0 SdLazy, 2294 SolverSat, 304 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 812 SyntacticMatches, 10 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 754 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 56 NumberOfFragments, 615 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4287102 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 14 FomulaSimplificationsInter, 30084 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 976 ConstructedInterpolants, 31 QuantifiedInterpolants, 106425 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1458 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...