./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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.25-f470102 [2019-12-07 16:02:20,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:02:20,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:02:20,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:02:20,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:02:20,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:02:20,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:02:20,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:02:20,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:02:20,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:02:20,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:02:20,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:02:20,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:02:20,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:02:20,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:02:20,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:02:20,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:02:20,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:02:20,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:02:20,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:02:20,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:02:20,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:02:20,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:02:20,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:02:20,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:02:20,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:02:20,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:02:20,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:02:20,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:02:20,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:02:20,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:02:20,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:02:20,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:02:20,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:02:20,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:02:20,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:02:20,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:02:20,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:02:20,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:02:20,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:02:20,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:02:20,537 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:02:20,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:02:20,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:02:20,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:02:20,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:02:20,547 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:02:20,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:02:20,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:02:20,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:02:20,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:02:20,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:02:20,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:02:20,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:02:20,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:02:20,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:02:20,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:02:20,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:02:20,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:02:20,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:02:20,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:02:20,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:02:20,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:02:20,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:20,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:02:20,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:02:20,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:02:20,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:02:20,666 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:02:20,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-12-07 16:02:20,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/c0a69e95b/49b2ccefd97e47ffb47bafc3c4565e40/FLAGd4e27456f [2019-12-07 16:02:21,189 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:02:21,190 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-12-07 16:02:21,194 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/c0a69e95b/49b2ccefd97e47ffb47bafc3c4565e40/FLAGd4e27456f [2019-12-07 16:02:21,688 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/c0a69e95b/49b2ccefd97e47ffb47bafc3c4565e40 [2019-12-07 16:02:21,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:02:21,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:02:21,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:21,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:02:21,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:02:21,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa646cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21, skipping insertion in model container [2019-12-07 16:02:21,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:02:21,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:02:21,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:21,863 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:02:21,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:21,896 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:02:21,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21 WrapperNode [2019-12-07 16:02:21,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:21,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:21,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:02:21,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:02:21,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:21,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:02:21,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:02:21,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:02:21,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... [2019-12-07 16:02:21,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:02:21,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:02:21,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:02:21,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:02:21,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:02:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-12-07 16:02:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:02:21,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:02:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:02:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:02:22,211 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:02:22,211 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 16:02:22,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:22 BoogieIcfgContainer [2019-12-07 16:02:22,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:02:22,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:02:22,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:02:22,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:02:22,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:02:21" (1/3) ... [2019-12-07 16:02:22,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fba4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:22, skipping insertion in model container [2019-12-07 16:02:22,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:21" (2/3) ... [2019-12-07 16:02:22,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fba4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:22, skipping insertion in model container [2019-12-07 16:02:22,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:22" (3/3) ... [2019-12-07 16:02:22,217 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-12-07 16:02:22,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:02:22,227 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:02:22,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 16:02:22,248 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:02:22,248 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:02:22,248 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:02:22,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:02:22,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:02:22,248 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:02:22,248 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:02:22,248 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:02:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 16:02:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:02:22,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:22,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:22,263 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-12-07 16:02:22,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:22,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755333040] [2019-12-07 16:02:22,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:22,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755333040] [2019-12-07 16:02:22,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:22,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:02:22,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839960194] [2019-12-07 16:02:22,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:22,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:22,385 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-12-07 16:02:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:22,432 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-12-07 16:02:22,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:02:22,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 16:02:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:22,441 INFO L225 Difference]: With dead ends: 90 [2019-12-07 16:02:22,441 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 16:02:22,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:02:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 16:02:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-12-07 16:02:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 16:02:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-12-07 16:02:22,468 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-12-07 16:02:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:22,468 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 16:02:22,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-12-07 16:02:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:02:22,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:22,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:22,469 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-12-07 16:02:22,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:22,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534238984] [2019-12-07 16:02:22,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:22,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-12-07 16:02:22,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534238984] [2019-12-07 16:02:22,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:22,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:02:22,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635012302] [2019-12-07 16:02:22,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:22,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:22,514 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-12-07 16:02:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:22,545 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-12-07 16:02:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:02:22,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:02:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:22,547 INFO L225 Difference]: With dead ends: 77 [2019-12-07 16:02:22,547 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 16:02:22,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:02:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 16:02:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-12-07 16:02:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 16:02:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-07 16:02:22,553 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-12-07 16:02:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:22,553 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-07 16:02:22,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-12-07 16:02:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:02:22,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:22,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:22,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-12-07 16:02:22,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:22,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587944440] [2019-12-07 16:02:22,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:22,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587944440] [2019-12-07 16:02:22,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:22,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:22,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633701792] [2019-12-07 16:02:22,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:22,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:22,592 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-12-07 16:02:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:22,602 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-12-07 16:02:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:22,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:02:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:22,603 INFO L225 Difference]: With dead ends: 50 [2019-12-07 16:02:22,603 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 16:02:22,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 16:02:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 16:02:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 16:02:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-12-07 16:02:22,608 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-12-07 16:02:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:22,608 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-12-07 16:02:22,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-12-07 16:02:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:02:22,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:22,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:22,609 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-12-07 16:02:22,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:22,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845107813] [2019-12-07 16:02:22,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:02:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:02:22,678 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:02:22,678 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:02:22,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:02:22 BoogieIcfgContainer [2019-12-07 16:02:22,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:02:22,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:02:22,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:02:22,700 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:02:22,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:22" (3/4) ... [2019-12-07 16:02:22,702 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 16:02:22,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:02:22,704 INFO L168 Benchmark]: Toolchain (without parser) took 1011.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -69.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:22,704 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:22,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:22,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.78 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:22,706 INFO L168 Benchmark]: Boogie Preprocessor took 21.27 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:22,706 INFO L168 Benchmark]: RCFGBuilder took 263.84 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: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:22,706 INFO L168 Benchmark]: TraceAbstraction took 486.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:22,707 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:22,709 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.78 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.27 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 263.84 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: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 486.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [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.4s, 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.0s SatisfiabilityAnalysisTime, 0.0s 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.25-f470102 [2019-12-07 16:02:24,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:02:24,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:02:24,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:02:24,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:02:24,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:02:24,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:02:24,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:02:24,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:02:24,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:02:24,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:02:24,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:02:24,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:02:24,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:02:24,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:02:24,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:02:24,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:02:24,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:02:24,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:02:24,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:02:24,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:02:24,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:02:24,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:02:24,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:02:24,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:02:24,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:02:24,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:02:24,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:02:24,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:02:24,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:02:24,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:02:24,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:02:24,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:02:24,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:02:24,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:02:24,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:02:24,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:02:24,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:02:24,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:02:24,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:02:24,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:02:24,089 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 16:02:24,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:02:24,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:02:24,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:02:24,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:02:24,100 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:02:24,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:02:24,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:02:24,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:02:24,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:02:24,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:02:24,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:02:24,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:02:24,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:02:24,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:02:24,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:02:24,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:02:24,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:02:24,103 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:24,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:02:24,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:02:24,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:02:24,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:02:24,277 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:02:24,278 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-12-07 16:02:24,314 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/d15d52584/c1ab2b095bc04bc8af00819e61b2c0aa/FLAG1064c38fa [2019-12-07 16:02:24,761 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:02:24,762 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-12-07 16:02:24,766 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/d15d52584/c1ab2b095bc04bc8af00819e61b2c0aa/FLAG1064c38fa [2019-12-07 16:02:24,776 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/data/d15d52584/c1ab2b095bc04bc8af00819e61b2c0aa [2019-12-07 16:02:24,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:02:24,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:02:24,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:24,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:02:24,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:02:24,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:24,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31403813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24, skipping insertion in model container [2019-12-07 16:02:24,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:24,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:02:24,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:02:24,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:24,932 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:02:24,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:24,966 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:02:24,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24 WrapperNode [2019-12-07 16:02:24,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:24,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:24,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:02:24,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:02:24,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:24,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:25,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:02:25,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:02:25,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:02:25,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... [2019-12-07 16:02:25,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:02:25,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:02:25,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:02:25,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:02:25,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:02:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 16:02:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:02:25,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:02:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-12-07 16:02:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:02:25,358 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:02:25,359 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 16:02:25,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:25 BoogieIcfgContainer [2019-12-07 16:02:25,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:02:25,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:02:25,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:02:25,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:02:25,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:02:24" (1/3) ... [2019-12-07 16:02:25,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa2e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:25, skipping insertion in model container [2019-12-07 16:02:25,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:24" (2/3) ... [2019-12-07 16:02:25,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa2e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:25, skipping insertion in model container [2019-12-07 16:02:25,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:25" (3/3) ... [2019-12-07 16:02:25,365 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-12-07 16:02:25,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:02:25,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:02:25,383 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 16:02:25,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:02:25,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:02:25,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:02:25,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:02:25,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:02:25,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:02:25,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:02:25,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:02:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 16:02:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:02:25,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:25,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:25,411 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-12-07 16:02:25,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:25,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917003433] [2019-12-07 16:02:25,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:25,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 16:02:25,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:25,491 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:25,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917003433] [2019-12-07 16:02:25,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:25,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 16:02:25,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369933357] [2019-12-07 16:02:25,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 16:02:25,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 16:02:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:02:25,508 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-12-07 16:02:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:25,522 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-12-07 16:02:25,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 16:02:25,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 16:02:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:25,530 INFO L225 Difference]: With dead ends: 82 [2019-12-07 16:02:25,530 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 16:02:25,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:02:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 16:02:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 16:02:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 16:02:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-12-07 16:02:25,559 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-12-07 16:02:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:25,559 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-12-07 16:02:25,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 16:02:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-12-07 16:02:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:02:25,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:25,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:25,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:02:25,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-12-07 16:02:25,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:25,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630983647] [2019-12-07 16:02:25,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:25,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:02:25,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:25,924 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:25,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:25,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630983647] [2019-12-07 16:02:25,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:25,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:02:25,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314863751] [2019-12-07 16:02:25,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:25,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:25,934 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-12-07 16:02:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:25,976 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-12-07 16:02:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:02:25,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 16:02:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:25,977 INFO L225 Difference]: With dead ends: 82 [2019-12-07 16:02:25,978 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 16:02:25,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:02:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 16:02:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-12-07 16:02:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 16:02:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-12-07 16:02:25,983 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-12-07 16:02:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:25,984 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 16:02:25,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-12-07 16:02:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:02:25,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:25,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:26,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:02:26,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-12-07 16:02:26,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:26,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517275437] [2019-12-07 16:02:26,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:26,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:02:26,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:26,341 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:26,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517275437] [2019-12-07 16:02:26,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:26,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:02:26,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10962492] [2019-12-07 16:02:26,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:02:26,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:02:26,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:02:26,356 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-12-07 16:02:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:26,420 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-12-07 16:02:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:02:26,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 16:02:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:26,421 INFO L225 Difference]: With dead ends: 96 [2019-12-07 16:02:26,421 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 16:02:26,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:02:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 16:02:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-12-07 16:02:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 16:02:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-07 16:02:26,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-12-07 16:02:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:26,428 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-07 16:02:26,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:02:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-12-07 16:02:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:02:26,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:26,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:26,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:02:26,630 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-12-07 16:02:26,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:26,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338742062] [2019-12-07 16:02:26,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:26,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:26,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:26,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:26,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:26,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:26,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338742062] [2019-12-07 16:02:26,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:26,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-12-07 16:02:26,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87742341] [2019-12-07 16:02:26,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:02:26,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:02:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:02:26,861 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-12-07 16:02:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:29,204 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-12-07 16:02:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:02:29,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 16:02:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:29,205 INFO L225 Difference]: With dead ends: 146 [2019-12-07 16:02:29,206 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 16:02:29,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:02:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 16:02:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-12-07 16:02:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 16:02:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-12-07 16:02:29,214 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-12-07 16:02:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:29,215 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-12-07 16:02:29,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:02:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-12-07 16:02:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:02:29,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:29,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:29,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:02:29,417 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-12-07 16:02:29,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:29,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704188410] [2019-12-07 16:02:29,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:29,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:29,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:29,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:29,657 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:29,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:29,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:29,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704188410] [2019-12-07 16:02:29,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:29,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-12-07 16:02:29,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760082672] [2019-12-07 16:02:29,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:02:29,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:29,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:02:29,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:02:29,740 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-12-07 16:02:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:30,503 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-12-07 16:02:30,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:02:30,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-07 16:02:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:30,506 INFO L225 Difference]: With dead ends: 180 [2019-12-07 16:02:30,506 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 16:02:30,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:02:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 16:02:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-12-07 16:02:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 16:02:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-12-07 16:02:30,520 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-12-07 16:02:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:30,521 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-12-07 16:02:30,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:02:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-12-07 16:02:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:02:30,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:30,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:30,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:02:30,724 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-12-07 16:02:30,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:30,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71984369] [2019-12-07 16:02:30,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:30,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:30,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:30,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:30,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:30,868 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:30,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:30,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:30,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:30,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71984369] [2019-12-07 16:02:30,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:30,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 16:02:30,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233188881] [2019-12-07 16:02:30,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:02:30,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:02:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:02:30,910 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-12-07 16:02:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:31,236 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-12-07 16:02:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:02:31,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 16:02:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:31,237 INFO L225 Difference]: With dead ends: 166 [2019-12-07 16:02:31,237 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 16:02:31,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:02:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 16:02:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-12-07 16:02:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 16:02:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-12-07 16:02:31,245 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-12-07 16:02:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:31,245 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-12-07 16:02:31,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:02:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-12-07 16:02:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:02:31,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:31,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:31,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:02:31,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-12-07 16:02:31,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:31,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831386496] [2019-12-07 16:02:31,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:31,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:02:31,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:31,586 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:31,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831386496] [2019-12-07 16:02:31,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:31,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:02:31,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394015448] [2019-12-07 16:02:31,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:02:31,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:02:31,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:02:31,596 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-12-07 16:02:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:31,651 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-12-07 16:02:31,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:02:31,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 16:02:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:31,652 INFO L225 Difference]: With dead ends: 157 [2019-12-07 16:02:31,652 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 16:02:31,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:02:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 16:02:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-12-07 16:02:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 16:02:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-12-07 16:02:31,659 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-12-07 16:02:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:31,660 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-12-07 16:02:31,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:02:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-12-07 16:02:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:02:31,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:31,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:31,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:02:31,862 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-12-07 16:02:31,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:31,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842177920] [2019-12-07 16:02:31,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:31,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:02:31,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:31,971 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:31,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842177920] [2019-12-07 16:02:31,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:31,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:02:31,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398209200] [2019-12-07 16:02:31,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:31,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:31,973 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-12-07 16:02:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:31,987 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-12-07 16:02:31,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:31,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:02:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:31,988 INFO L225 Difference]: With dead ends: 96 [2019-12-07 16:02:31,988 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 16:02:31,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 16:02:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-12-07 16:02:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 16:02:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-12-07 16:02:31,996 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-12-07 16:02:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:31,997 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-12-07 16:02:31,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-12-07 16:02:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:02:31,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:31,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:32,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:02:32,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-12-07 16:02:32,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:32,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847102192] [2019-12-07 16:02:32,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:32,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:32,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:32,331 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:32,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:32,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847102192] [2019-12-07 16:02:32,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:32,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-12-07 16:02:32,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259387738] [2019-12-07 16:02:32,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:02:32,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:02:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:02:32,369 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-12-07 16:02:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:32,616 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-12-07 16:02:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:02:32,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-07 16:02:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:32,617 INFO L225 Difference]: With dead ends: 131 [2019-12-07 16:02:32,617 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 16:02:32,617 INFO L630 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-12-07 16:02:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 16:02:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-12-07 16:02:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 16:02:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-12-07 16:02:32,624 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-12-07 16:02:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:32,624 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-12-07 16:02:32,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:02:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-12-07 16:02:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:02:32,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:32,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:32,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:02:32,826 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:32,827 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-12-07 16:02:32,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:32,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68688966] [2019-12-07 16:02:32,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:32,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:02:32,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:32,985 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:33,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68688966] [2019-12-07 16:02:33,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:33,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-12-07 16:02:33,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859518081] [2019-12-07 16:02:33,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:02:33,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:33,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:02:33,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:02:33,028 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-12-07 16:02:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:33,292 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-12-07 16:02:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:02:33,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-07 16:02:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:33,293 INFO L225 Difference]: With dead ends: 114 [2019-12-07 16:02:33,293 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 16:02:33,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:02:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 16:02:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 16:02:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 16:02:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-12-07 16:02:33,298 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-12-07 16:02:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:33,298 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-12-07 16:02:33,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:02:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-12-07 16:02:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:02:33,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:33,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:33,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 16:02:33,500 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-12-07 16:02:33,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:33,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071859854] [2019-12-07 16:02:33,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:33,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:33,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:33,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:33,660 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:33,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071859854] [2019-12-07 16:02:33,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:33,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 16:02:33,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796706816] [2019-12-07 16:02:33,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:02:33,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:02:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:02:33,690 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-12-07 16:02:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:33,874 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-12-07 16:02:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:02:33,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 16:02:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:33,875 INFO L225 Difference]: With dead ends: 84 [2019-12-07 16:02:33,875 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:02:33,875 INFO L630 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-12-07 16:02:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:02:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 16:02:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 16:02:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-12-07 16:02:33,879 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-12-07 16:02:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:33,879 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-12-07 16:02:33,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:02:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-12-07 16:02:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:02:33,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:33,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:34,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 16:02:34,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-12-07 16:02:34,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:34,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411695783] [2019-12-07 16:02:34,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:34,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 16:02:34,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:34,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:34,229 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:34,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:34,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411695783] [2019-12-07 16:02:34,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:34,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 16:02:34,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43577211] [2019-12-07 16:02:34,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:02:34,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:34,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:02:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:02:34,457 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-12-07 16:02:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:34,707 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-12-07 16:02:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:02:34,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-07 16:02:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:34,709 INFO L225 Difference]: With dead ends: 82 [2019-12-07 16:02:34,709 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:02:34,709 INFO L630 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-12-07 16:02:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:02:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 16:02:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 16:02:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-12-07 16:02:34,714 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-12-07 16:02:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:34,714 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-12-07 16:02:34,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:02:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-12-07 16:02:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:02:34,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:34,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:34,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 16:02:34,916 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:34,917 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-12-07 16:02:34,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:34,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294480372] [2019-12-07 16:02:34,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:34,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:34,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:36,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:36,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294480372] [2019-12-07 16:02:36,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:36,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-12-07 16:02:36,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908567236] [2019-12-07 16:02:36,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:02:36,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:02:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:02:36,371 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-12-07 16:02:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:39,529 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2019-12-07 16:02:39,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:02:39,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-12-07 16:02:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:39,530 INFO L225 Difference]: With dead ends: 224 [2019-12-07 16:02:39,530 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 16:02:39,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:02:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 16:02:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 82. [2019-12-07 16:02:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 16:02:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-12-07 16:02:39,538 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 26 [2019-12-07 16:02:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:39,538 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-12-07 16:02:39,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:02:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-12-07 16:02:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:02:39,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:39,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:39,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 16:02:39,740 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-12-07 16:02:39,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:39,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551170221] [2019-12-07 16:02:39,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:39,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 16:02:39,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:39,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:39,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:39,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:40,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:40,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:40,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:40,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551170221] [2019-12-07 16:02:40,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:40,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-12-07 16:02:40,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453087566] [2019-12-07 16:02:40,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:02:40,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:02:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:02:40,240 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 15 states. [2019-12-07 16:02:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:42,059 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2019-12-07 16:02:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 16:02:42,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-07 16:02:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:42,061 INFO L225 Difference]: With dead ends: 245 [2019-12-07 16:02:42,061 INFO L226 Difference]: Without dead ends: 220 [2019-12-07 16:02:42,062 INFO L630 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-12-07 16:02:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-07 16:02:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 72. [2019-12-07 16:02:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 16:02:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-12-07 16:02:42,069 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 27 [2019-12-07 16:02:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:42,069 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-12-07 16:02:42,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:02:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-12-07 16:02:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:02:42,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:42,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:42,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 16:02:42,271 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-12-07 16:02:42,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:42,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119251117] [2019-12-07 16:02:42,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:42,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 16:02:42,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:42,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:42,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:42,536 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:42,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:42,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119251117] [2019-12-07 16:02:42,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:42,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-12-07 16:02:42,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088337724] [2019-12-07 16:02:42,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:02:42,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:42,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:02:42,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:02:42,663 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 12 states. [2019-12-07 16:02:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:43,704 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2019-12-07 16:02:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 16:02:43,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-12-07 16:02:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:43,705 INFO L225 Difference]: With dead ends: 187 [2019-12-07 16:02:43,705 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 16:02:43,706 INFO L630 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-12-07 16:02:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 16:02:43,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 70. [2019-12-07 16:02:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 16:02:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-12-07 16:02:43,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2019-12-07 16:02:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:43,711 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-12-07 16:02:43,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:02:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-12-07 16:02:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:02:43,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:43,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:43,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 16:02:43,912 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1881082413, now seen corresponding path program 1 times [2019-12-07 16:02:43,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:43,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410142296] [2019-12-07 16:02:43,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:43,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:02:44,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:44,085 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:44,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:44,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410142296] [2019-12-07 16:02:44,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:44,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-12-07 16:02:44,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300753313] [2019-12-07 16:02:44,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:02:44,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:02:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:02:44,244 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 16 states. [2019-12-07 16:02:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:45,342 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-12-07 16:02:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:02:45,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-12-07 16:02:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:45,344 INFO L225 Difference]: With dead ends: 129 [2019-12-07 16:02:45,344 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 16:02:45,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 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-12-07 16:02:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 16:02:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2019-12-07 16:02:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:02:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-12-07 16:02:45,347 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 29 [2019-12-07 16:02:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:45,347 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-12-07 16:02:45,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:02:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-12-07 16:02:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:02:45,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:45,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:45,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:02:45,549 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:45,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-12-07 16:02:45,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:45,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041858110] [2019-12-07 16:02:45,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:45,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:02:45,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:45,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:45,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:45,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:45,660 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:45,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:45,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041858110] [2019-12-07 16:02:45,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:45,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 16:02:45,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39404309] [2019-12-07 16:02:45,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:02:45,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:02:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:02:45,867 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-12-07 16:02:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:46,414 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 16:02:46,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:02:46,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-07 16:02:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:46,415 INFO L225 Difference]: With dead ends: 52 [2019-12-07 16:02:46,415 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:02:46,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:02:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:02:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 16:02:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:02:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-12-07 16:02:46,419 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-12-07 16:02:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:46,419 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-12-07 16:02:46,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:02:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-12-07 16:02:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:02:46,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:46,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:46,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 16:02:46,620 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:46,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-12-07 16:02:46,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:46,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654598475] [2019-12-07 16:02:46,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:46,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 16:02:46,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:46,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:46,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:46,813 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:46,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:46,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:46,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654598475] [2019-12-07 16:02:46,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:46,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-12-07 16:02:46,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97144136] [2019-12-07 16:02:46,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:02:46,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:02:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:02:46,922 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-12-07 16:02:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,502 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-12-07 16:02:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:02:47,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-12-07 16:02:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,503 INFO L225 Difference]: With dead ends: 55 [2019-12-07 16:02:47,503 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:02:47,504 INFO L630 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-12-07 16:02:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:02:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-12-07 16:02:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 16:02:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-12-07 16:02:47,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-12-07 16:02:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,508 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-12-07 16:02:47,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:02:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-12-07 16:02:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:02:47,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 16:02:47,710 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-12-07 16:02:47,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:47,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400793390] [2019-12-07 16:02:47,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 16:02:47,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:47,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,903 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:47,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400793390] [2019-12-07 16:02:48,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 16:02:48,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163547789] [2019-12-07 16:02:48,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:02:48,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:48,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:02:48,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:02:48,011 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-12-07 16:02:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,431 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-12-07 16:02:48,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:02:48,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-12-07 16:02:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,432 INFO L225 Difference]: With dead ends: 79 [2019-12-07 16:02:48,432 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 16:02:48,433 INFO L630 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-12-07 16:02:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 16:02:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-12-07 16:02:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 16:02:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-12-07 16:02:48,436 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-12-07 16:02:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,436 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-12-07 16:02:48,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:02:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-12-07 16:02:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:02:48,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 16:02:48,637 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-12-07 16:02:48,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:02:48,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136741579] [2019-12-07 16:02:48,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/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-12-07 16:02:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:02:48,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:02:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136741579] [2019-12-07 16:02:48,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:02:48,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530603256] [2019-12-07 16:02:48,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:48,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:02:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:48,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:48,718 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-12-07 16:02:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,737 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-12-07 16:02:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:02:48,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 16:02:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,738 INFO L225 Difference]: With dead ends: 39 [2019-12-07 16:02:48,738 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:02:48,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:02:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:02:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:02:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:02:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:02:48,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-12-07 16:02:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,739 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:02:48,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:02:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:02:48,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 16:02:48,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:02:49,135 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 84 [2019-12-07 16:02:49,863 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-12-07 16:02:50,718 WARN L192 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 25 [2019-12-07 16:02:50,937 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-12-07 16:02:51,316 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 31 [2019-12-07 16:02:51,619 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2019-12-07 16:02:51,819 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-12-07 16:02:52,501 WARN L192 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 36 [2019-12-07 16:02:52,822 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-12-07 16:02:53,015 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-12-07 16:02:53,084 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-12-07 16:02:53,084 INFO L249 CegarLoopResult]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-12-07 16:02:53,084 INFO L246 CegarLoopResult]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-12-07 16:02:53,084 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,085 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,085 INFO L246 CegarLoopResult]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-12-07 16:02:53,085 INFO L246 CegarLoopResult]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-12-07 16:02:53,085 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 16:02:53,085 INFO L246 CegarLoopResult]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-12-07 16:02:53,085 INFO L242 CegarLoopResult]: 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-12-07 16:02:53,085 INFO L242 CegarLoopResult]: 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-12-07 16:02:53,085 INFO L242 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short13|)) (.cse2 (not |ULTIMATE.start_main_#t~short9|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse2 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse0)))) [2019-12-07 16:02:53,085 INFO L242 CegarLoopResult]: 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-12-07 16:02:53,085 INFO L242 CegarLoopResult]: At program point L55-4(line 55) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.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))) (.cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y .cse0) .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse3 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse4) (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) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) .cse2 .cse4 (not (fp.eq .cse0 .cse0)) (= (_ 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) .cse1 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-12-07 16:02:53,086 INFO L242 CegarLoopResult]: 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 |ULTIMATE.start_main_#t~short17| (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) .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-12-07 16:02:53,086 INFO L242 CegarLoopResult]: At program point L55-6(line 55) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (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) (= 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))) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)))) [2019-12-07 16:02:53,086 INFO L242 CegarLoopResult]: At program point L55-7(line 55) the Hoare annotation is: (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)))) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~y .cse0) (= (_ 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) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq .cse0 .cse0)))) [2019-12-07 16:02:53,086 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-12-07 16:02:53,086 INFO L246 CegarLoopResult]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-12-07 16:02:53,086 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-12-07 16:02:53,086 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-12-07 16:02:53,086 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y))) (or (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)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and (not .cse1) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2019-12-07 16:02:53,086 INFO L246 CegarLoopResult]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-12-07 16:02:53,086 INFO L246 CegarLoopResult]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L242 CegarLoopResult]: 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 .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)) (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))) [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L242 CegarLoopResult]: At program point L40(lines 20 41) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and (not .cse1) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= 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))) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2019-12-07 16:02:53,087 INFO L242 CegarLoopResult]: At program point L40-1(lines 20 41) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.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))) (or (and (= ULTIMATE.start_fmax_float_~y .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not .cse1) .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 (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse2 .cse1 (not (fp.eq .cse0 .cse0)) .cse3 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-12-07 16:02:53,087 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L242 CegarLoopResult]: 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) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) .cse0 .cse3 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 16:02:53,088 INFO L246 CegarLoopResult]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-12-07 16:02:53,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:02:53 BoogieIcfgContainer [2019-12-07 16:02:53,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:02:53,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:02:53,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:02:53,109 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:02:53,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:25" (3/4) ... [2019-12-07 16:02:53,112 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:02:53,121 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-12-07 16:02:53,121 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 16:02:53,122 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 16:02:53,139 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-12-07 16:02:53,140 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-12-07 16:02:53,140 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 1bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-12-07 16:02:53,140 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-12-07 16:02:53,140 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((!~fp.eq~FLOAT(y, y) && x == x) && 1bv32 == \result) && x == x) && ~fp.eq~FLOAT(x, x)) && y == y) [2019-12-07 16:02:53,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && y == y) [2019-12-07 16:02:53,141 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) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && y == y) && y == x) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-12-07 16:02:53,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) [2019-12-07 16:02:53,141 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])) && 1bv32 == \result) && 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)) && ~fp.eq~FLOAT(res, 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]))) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x))) || (((((~fp.eq~FLOAT(y, y) && 1bv32 == \result) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-12-07 16:02:53,141 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)) && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && 0bv32 == \result) && !~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-12-07 16:02:53,142 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && 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-12-07 16:02:53,142 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(x, x) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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]))) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) [2019-12-07 16:02:53,142 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(x, x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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])) [2019-12-07 16:02:53,161 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ac0e2a44-07e3-4e87-9af1-157878355991/bin/uautomizer/witness.graphml [2019-12-07 16:02:53,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:02:53,162 INFO L168 Benchmark]: Toolchain (without parser) took 28382.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 951.0 MB in the beginning and 809.2 MB in the end (delta: 141.8 MB). Peak memory consumption was 458.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,162 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:53,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.67 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,163 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 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-12-07 16:02:53,163 INFO L168 Benchmark]: RCFGBuilder took 303.11 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,163 INFO L168 Benchmark]: TraceAbstraction took 27748.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 809.2 MB in the end (delta: 276.4 MB). Peak memory consumption was 469.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,163 INFO L168 Benchmark]: Witness Printer took 51.74 ms. Allocated memory is still 1.3 GB. Free memory is still 809.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:53,164 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.67 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 303.11 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27748.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 809.2 MB in the end (delta: 276.4 MB). Peak memory consumption was 469.8 MB. Max. memory is 11.5 GB. * Witness Printer took 51.74 ms. Allocated memory is still 1.3 GB. Free memory is still 809.2 MB. There was no memory consumed. 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) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && y == y) && y == x) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(x, x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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])) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(x, x) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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]))) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) - 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)) && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && 0bv32 == \result) && !~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: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && 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: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && y == y) - 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])) && 1bv32 == \result) && 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)) && ~fp.eq~FLOAT(res, 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]))) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x))) || (((((~fp.eq~FLOAT(y, y) && 1bv32 == \result) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) - 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: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 1bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((!~fp.eq~FLOAT(y, y) && x == x) && 1bv32 == \result) && x == x) && ~fp.eq~FLOAT(x, x)) && 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: 23.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 1234 SDtfs, 3154 SDslu, 4940 SDs, 0 SdLazy, 2309 SolverSat, 286 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 812 SyntacticMatches, 10 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 8.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, 751 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 56 NumberOfFragments, 612 HoareAnnotationTreeSize, 14 FomulaSimplifications, 3864490 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 260745 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 976 ConstructedInterpolants, 31 QuantifiedInterpolants, 106213 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1498 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...