./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 .............................................................................................................................................................................................................................................................................................................................................................. 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_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:56:12,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:56:12,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:56:12,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:56:12,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:56:12,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:56:13,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:56:13,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:56:13,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:56:13,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:56:13,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:56:13,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:56:13,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:56:13,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:56:13,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:56:13,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:56:13,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:56:13,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:56:13,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:56:13,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:56:13,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:56:13,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:56:13,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:56:13,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:56:13,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:56:13,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:56:13,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:56:13,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:56:13,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:56:13,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:56:13,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:56:13,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:56:13,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:56:13,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:56:13,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:56:13,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:56:13,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:56:13,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:56:13,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:56:13,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:56:13,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:56:13,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:56:13,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:56:13,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:56:13,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:56:13,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:56:13,081 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:56:13,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:56:13,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:56:13,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:56:13,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:56:13,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:56:13,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:56:13,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:56:13,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:56:13,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:56:13,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:56:13,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:56:13,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:56:13,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:56:13,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:56:13,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:56:13,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:56:13,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:56:13,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:56:13,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:56:13,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:56:13,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:56:13,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:56:13,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:56:13,085 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_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2019-11-20 02:56:13,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:56:13,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:56:13,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:56:13,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:56:13,253 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:56:13,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2019-11-20 02:56:13,308 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/37ec5937d/d429faefc76d49f281be1e5cb18567d0/FLAG25a1f2e05 [2019-11-20 02:56:13,718 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:56:13,720 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2019-11-20 02:56:13,727 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/37ec5937d/d429faefc76d49f281be1e5cb18567d0/FLAG25a1f2e05 [2019-11-20 02:56:13,742 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/37ec5937d/d429faefc76d49f281be1e5cb18567d0 [2019-11-20 02:56:13,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:56:13,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:56:13,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:56:13,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:56:13,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:56:13,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:13" (1/1) ... [2019-11-20 02:56:13,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4346de15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:13, skipping insertion in model container [2019-11-20 02:56:13,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:13" (1/1) ... [2019-11-20 02:56:13,765 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:56:13,786 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:56:14,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:56:14,053 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:56:14,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:56:14,113 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:56:14,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14 WrapperNode [2019-11-20 02:56:14,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:56:14,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:56:14,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:56:14,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:56:14,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:56:14,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:56:14,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:56:14,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:56:14,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... [2019-11-20 02:56:14,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:56:14,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:56:14,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:56:14,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:56:14,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:56:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:56:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 02:56:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:56:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:56:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:56:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:56:14,536 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:56:14,537 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 02:56:14,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:14 BoogieIcfgContainer [2019-11-20 02:56:14,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:56:14,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:56:14,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:56:14,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:56:14,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:13" (1/3) ... [2019-11-20 02:56:14,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d87e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:14, skipping insertion in model container [2019-11-20 02:56:14,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:14" (2/3) ... [2019-11-20 02:56:14,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d87e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:14, skipping insertion in model container [2019-11-20 02:56:14,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:14" (3/3) ... [2019-11-20 02:56:14,544 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2019-11-20 02:56:14,552 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:56:14,558 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:56:14,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:56:14,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:56:14,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:56:14,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:56:14,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:56:14,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:56:14,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:56:14,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:56:14,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:56:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-20 02:56:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:56:14,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:14,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:14,610 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-20 02:56:14,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:56:14,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16945447] [2019-11-20 02:56:14,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:56:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:14,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16945447] [2019-11-20 02:56:14,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:14,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:56:14,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110481856] [2019-11-20 02:56:14,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 02:56:14,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:56:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 02:56:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:56:14,741 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-20 02:56:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:14,758 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-20 02:56:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 02:56:14,759 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 02:56:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:14,767 INFO L225 Difference]: With dead ends: 56 [2019-11-20 02:56:14,768 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 02:56:14,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:56:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 02:56:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 02:56:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 02:56:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-20 02:56:14,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-20 02:56:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:14,799 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-20 02:56:14,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 02:56:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-20 02:56:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:56:14,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:14,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:14,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-20 02:56:14,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:56:14,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658977731] [2019-11-20 02:56:14,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:56:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:14,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658977731] [2019-11-20 02:56:14,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:14,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:56:14,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918338574] [2019-11-20 02:56:14,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:56:14,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:56:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:56:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:56:14,882 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-11-20 02:56:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:14,960 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-20 02:56:14,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:56:14,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-20 02:56:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:14,962 INFO L225 Difference]: With dead ends: 40 [2019-11-20 02:56:14,962 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 02:56:14,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:56:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 02:56:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-11-20 02:56:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:56:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-20 02:56:14,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-20 02:56:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:14,969 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-20 02:56:14,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:56:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-20 02:56:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:56:14,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:14,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:14,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-11-20 02:56:14,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:56:14,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495290238] [2019-11-20 02:56:14,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:56:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:15,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495290238] [2019-11-20 02:56:15,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:15,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:56:15,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772905689] [2019-11-20 02:56:15,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:56:15,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:56:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:56:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:56:15,061 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-11-20 02:56:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:15,119 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-11-20 02:56:15,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:56:15,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 02:56:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:15,121 INFO L225 Difference]: With dead ends: 42 [2019-11-20 02:56:15,121 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 02:56:15,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:56:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 02:56:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-11-20 02:56:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:56:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-20 02:56:15,130 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-11-20 02:56:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:15,130 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-20 02:56:15,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:56:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-20 02:56:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:56:15,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:15,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:15,132 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-20 02:56:15,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:56:15,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331435842] [2019-11-20 02:56:15,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:56:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:56:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:56:15,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:56:15,213 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 02:56:15,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:56:15 BoogieIcfgContainer [2019-11-20 02:56:15,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:56:15,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:56:15,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:56:15,240 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:56:15,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:14" (3/4) ... [2019-11-20 02:56:15,244 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 02:56:15,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:56:15,246 INFO L168 Benchmark]: Toolchain (without parser) took 1498.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -54.4 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2019-11-20 02:56:15,247 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:56:15,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:56:15,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:56:15,248 INFO L168 Benchmark]: Boogie Preprocessor took 36.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:56:15,249 INFO L168 Benchmark]: RCFGBuilder took 345.08 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:56:15,249 INFO L168 Benchmark]: TraceAbstraction took 700.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:56:15,250 INFO L168 Benchmark]: Witness Printer took 4.46 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-11-20 02:56:15,253 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 345.08 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 700.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.46 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: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; [L16] return x != x; [L72] COND TRUE !isnan_double(x) [L27] __uint32_t msw, lsw; [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x [L78] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 20 SDslu, 112 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, 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, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 02:56:17,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:56:17,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:56:17,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:56:17,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:56:17,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:56:17,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:56:17,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:56:17,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:56:17,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:56:17,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:56:17,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:56:17,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:56:17,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:56:17,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:56:17,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:56:17,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:56:17,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:56:17,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:56:17,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:56:17,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:56:17,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:56:17,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:56:17,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:56:17,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:56:17,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:56:17,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:56:17,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:56:17,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:56:17,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:56:17,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:56:17,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:56:17,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:56:17,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:56:17,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:56:17,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:56:17,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:56:17,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:56:17,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:56:17,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:56:17,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:56:17,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 02:56:17,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:56:17,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:56:17,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:56:17,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:56:17,324 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:56:17,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:56:17,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:56:17,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:56:17,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:56:17,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:56:17,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:56:17,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:56:17,327 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 02:56:17,327 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 02:56:17,327 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:56:17,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:56:17,328 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:56:17,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:56:17,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:56:17,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:56:17,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:56:17,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:56:17,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:56:17,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:56:17,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:56:17,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:56:17,331 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 02:56:17,331 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 02:56:17,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:56:17,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 02:56:17,332 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_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2019-11-20 02:56:17,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:56:17,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:56:17,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:56:17,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:56:17,631 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:56:17,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2019-11-20 02:56:17,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/ae843a7f7/e9c8a997b67a475a8cfe95a8b4a21b5a/FLAGae315a71e [2019-11-20 02:56:18,071 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:56:18,072 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2019-11-20 02:56:18,078 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/ae843a7f7/e9c8a997b67a475a8cfe95a8b4a21b5a/FLAGae315a71e [2019-11-20 02:56:18,411 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/data/ae843a7f7/e9c8a997b67a475a8cfe95a8b4a21b5a [2019-11-20 02:56:18,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:56:18,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:56:18,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:56:18,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:56:18,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:56:18,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aafa99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18, skipping insertion in model container [2019-11-20 02:56:18,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:56:18,457 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:56:18,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:56:18,620 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:56:18,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:56:18,672 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:56:18,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18 WrapperNode [2019-11-20 02:56:18,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:56:18,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:56:18,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:56:18,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:56:18,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:56:18,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:56:18,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:56:18,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:56:18,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... [2019-11-20 02:56:18,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:56:18,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:56:18,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:56:18,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:56:18,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:56:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 02:56:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:56:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 02:56:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:56:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:56:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:56:19,297 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:56:19,297 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 02:56:19,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:19 BoogieIcfgContainer [2019-11-20 02:56:19,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:56:19,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:56:19,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:56:19,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:56:19,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:18" (1/3) ... [2019-11-20 02:56:19,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39610943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:19, skipping insertion in model container [2019-11-20 02:56:19,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:18" (2/3) ... [2019-11-20 02:56:19,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39610943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:19, skipping insertion in model container [2019-11-20 02:56:19,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:19" (3/3) ... [2019-11-20 02:56:19,305 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2019-11-20 02:56:19,314 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:56:19,320 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:56:19,329 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:56:19,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:56:19,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:56:19,348 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:56:19,348 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:56:19,348 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:56:19,348 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:56:19,348 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:56:19,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:56:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-20 02:56:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:56:19,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:19,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:19,365 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-20 02:56:19,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:56:19,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269202552] [2019-11-20 02:56:19,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 02:56:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:19,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 02:56:19,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:56:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:19,483 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:56:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:19,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269202552] [2019-11-20 02:56:19,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:19,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 02:56:19,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729352559] [2019-11-20 02:56:19,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 02:56:19,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:56:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 02:56:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:56:19,508 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-20 02:56:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:19,526 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-20 02:56:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 02:56:19,527 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 02:56:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:19,536 INFO L225 Difference]: With dead ends: 56 [2019-11-20 02:56:19,537 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 02:56:19,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:56:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 02:56:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 02:56:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 02:56:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-20 02:56:19,567 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-20 02:56:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:19,568 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-20 02:56:19,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 02:56:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-20 02:56:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:56:19,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:19,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:19,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 02:56:19,782 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-20 02:56:19,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:56:19,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998992139] [2019-11-20 02:56:19,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 02:56:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:19,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:56:19,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:56:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:19,912 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:56:19,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-11-20 02:56:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998992139] [2019-11-20 02:56:19,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:19,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:56:19,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16978398] [2019-11-20 02:56:19,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:56:19,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:56:19,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:56:19,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:56:19,935 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2019-11-20 02:56:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:20,060 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-20 02:56:20,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:56:20,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-20 02:56:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:20,062 INFO L225 Difference]: With dead ends: 50 [2019-11-20 02:56:20,063 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 02:56:20,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:56:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 02:56:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2019-11-20 02:56:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:56:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-20 02:56:20,071 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-20 02:56:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:20,071 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-20 02:56:20,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:56:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-20 02:56:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:56:20,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:20,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:20,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 02:56:20,294 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-20 02:56:20,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:56:20,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873563343] [2019-11-20 02:56:20,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 02:56:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:20,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 02:56:20,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:56:20,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-11-20 02:56:20,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2019-11-20 02:56:20,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:20,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:20,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:56:20,620 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:20,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:20,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:20,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 02:56:20,656 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:20,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:20,667 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:20,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:20,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:56:20,687 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:33 [2019-11-20 02:56:22,114 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) c_ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 c_ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_2_3) .cse1)))) is different from true [2019-11-20 02:56:30,610 WARN L191 SmtUtils]: Spent 8.44 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-20 02:56:32,781 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-11-20 02:56:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:32,795 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:56:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:35,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 02:56:35,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 02:56:35,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:35,435 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-20 02:56:35,435 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.8 percent of original size [2019-11-20 02:56:35,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-20 02:56:35,461 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:35,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2019-11-20 02:56:35,523 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:35,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,553 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:35,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 02:56:35,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 02:56:35,842 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:35,922 INFO L567 ElimStorePlain]: treesize reduction 7, result has 92.5 percent of original size [2019-11-20 02:56:35,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-20 02:56:35,952 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:35,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:35,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-11-20 02:56:35,996 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,013 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 02:56:36,299 INFO L237 Elim1Store]: Index analysis took 105 ms [2019-11-20 02:56:36,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 02:56:36,323 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,393 INFO L567 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-11-20 02:56:36,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-20 02:56:36,428 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-20 02:56:36,475 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,490 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,626 INFO L237 Elim1Store]: Index analysis took 109 ms [2019-11-20 02:56:36,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 02:56:36,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 02:56:36,792 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,865 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-11-20 02:56:36,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-20 02:56:36,895 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-20 02:56:36,932 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:36,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:36,947 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 02:56:37,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 02:56:37,231 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,234 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-20 02:56:37,242 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_21 vanished before elimination [2019-11-20 02:56:37,242 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_23 vanished before elimination [2019-11-20 02:56:37,243 INFO L496 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,359 INFO L237 Elim1Store]: Index analysis took 102 ms [2019-11-20 02:56:37,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 02:56:37,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 02:56:37,516 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,520 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-20 02:56:37,529 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_25 vanished before elimination [2019-11-20 02:56:37,529 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_27 vanished before elimination [2019-11-20 02:56:37,529 INFO L496 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,638 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 02:56:37,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 02:56:37,745 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,748 INFO L567 ElimStorePlain]: treesize reduction 104, result has 1.0 percent of original size [2019-11-20 02:56:37,755 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_29 vanished before elimination [2019-11-20 02:56:37,756 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_32 vanished before elimination [2019-11-20 02:56:37,756 INFO L496 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 02:56:37,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 02:56:37,835 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,838 INFO L567 ElimStorePlain]: treesize reduction 102, result has 1.0 percent of original size [2019-11-20 02:56:37,841 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_35 vanished before elimination [2019-11-20 02:56:37,841 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_34 vanished before elimination [2019-11-20 02:56:37,842 INFO L496 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:56:37,953 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 02:56:37,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:56:37,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-11-20 02:56:37,955 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:857, output treesize:137 [2019-11-20 02:56:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:38,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873563343] [2019-11-20 02:56:38,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:38,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 02:56:38,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252363744] [2019-11-20 02:56:38,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:56:38,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:56:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:56:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2019-11-20 02:56:38,122 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 13 states. [2019-11-20 02:56:43,077 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-11-20 02:56:49,177 WARN L191 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 02:56:51,464 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 30 [2019-11-20 02:56:55,184 WARN L191 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 02:56:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:57,525 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-20 02:56:57,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 02:56:57,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-20 02:56:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:57,527 INFO L225 Difference]: With dead ends: 70 [2019-11-20 02:56:57,527 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 02:56:57,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=140, Invalid=323, Unknown=3, NotChecked=40, Total=506 [2019-11-20 02:56:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 02:56:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 26. [2019-11-20 02:56:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 02:56:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-20 02:56:57,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-11-20 02:56:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:57,534 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-20 02:56:57,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:56:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-20 02:56:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 02:56:57,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:57,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:57,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 02:56:57,736 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2019-11-20 02:56:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:56:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809561541] [2019-11-20 02:56:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 02:56:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:57,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:56:57,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:56:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:57,828 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:56:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:57,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809561541] [2019-11-20 02:56:57,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:57,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:56:57,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093185293] [2019-11-20 02:56:57,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:56:57,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:56:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:56:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:56:57,852 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 6 states. [2019-11-20 02:56:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:58,429 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-20 02:56:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:56:58,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-20 02:56:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:58,431 INFO L225 Difference]: With dead ends: 48 [2019-11-20 02:56:58,431 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 02:56:58,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:56:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 02:56:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2019-11-20 02:56:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:56:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-20 02:56:58,439 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-11-20 02:56:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:58,439 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-20 02:56:58,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:56:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-20 02:56:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:56:58,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:58,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:58,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 02:56:58,655 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2019-11-20 02:56:58,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:56:58,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602911536] [2019-11-20 02:56:58,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 02:56:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:58,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:56:58,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:56:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:58,753 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:56:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:59,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602911536] [2019-11-20 02:56:59,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:59,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:56:59,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492836454] [2019-11-20 02:56:59,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:56:59,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:56:59,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:56:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:56:59,043 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2019-11-20 02:56:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:59,062 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-20 02:56:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:56:59,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 02:56:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:59,064 INFO L225 Difference]: With dead ends: 33 [2019-11-20 02:56:59,064 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 02:56:59,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:56:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 02:56:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 02:56:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:56:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-20 02:56:59,071 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-11-20 02:56:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:59,071 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-20 02:56:59,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:56:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-20 02:56:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:56:59,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:59,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:56:59,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 02:56:59,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:56:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:56:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2019-11-20 02:56:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:56:59,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264899081] [2019-11-20 02:56:59,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 02:56:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:56:59,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 02:56:59,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:56:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:59,453 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:56:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:56:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:56:59,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264899081] [2019-11-20 02:56:59,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:56:59,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 02:56:59,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699137696] [2019-11-20 02:56:59,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:56:59,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:56:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:56:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:56:59,672 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2019-11-20 02:56:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:56:59,952 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-11-20 02:56:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:56:59,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 02:56:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:56:59,954 INFO L225 Difference]: With dead ends: 40 [2019-11-20 02:56:59,954 INFO L226 Difference]: Without dead ends: 32 [2019-11-20 02:56:59,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-20 02:56:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-20 02:56:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-20 02:56:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:56:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-20 02:56:59,960 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-20 02:56:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:56:59,960 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-20 02:56:59,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:56:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-20 02:56:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:56:59,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:56:59,961 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] [2019-11-20 02:57:00,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 02:57:00,173 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:57:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2019-11-20 02:57:00,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:57:00,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236072389] [2019-11-20 02:57:00,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 02:57:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:00,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 02:57:00,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:00,609 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 02:57:00,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:00,846 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:57:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236072389] [2019-11-20 02:57:01,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:01,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 02:57:01,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003342917] [2019-11-20 02:57:01,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 02:57:01,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:57:01,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 02:57:01,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:57:01,076 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2019-11-20 02:57:01,922 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 02:57:02,064 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-20 02:57:02,657 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-11-20 02:57:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:03,122 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-11-20 02:57:03,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 02:57:03,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-20 02:57:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:57:03,124 INFO L225 Difference]: With dead ends: 70 [2019-11-20 02:57:03,124 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 02:57:03,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-20 02:57:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 02:57:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-20 02:57:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 02:57:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-20 02:57:03,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-11-20 02:57:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:57:03,137 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-20 02:57:03,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 02:57:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-20 02:57:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:57:03,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:57:03,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:03,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 02:57:03,339 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:57:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2019-11-20 02:57:03,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:57:03,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868914870] [2019-11-20 02:57:03,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 02:57:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:03,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 02:57:03,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:03,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-20 02:57:03,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-20 02:57:03,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-20 02:57:03,512 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 02:57:03,534 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,544 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:57:03,559 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:30 [2019-11-20 02:57:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:03,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:57:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:03,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-20 02:57:03,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-20 02:57:03,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-20 02:57:03,803 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:57:03,835 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,867 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:57:03,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-20 02:57:03,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:03,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-20 02:57:03,988 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:04,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:04,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 02:57:04,045 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:04,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:04,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:04,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:57:04,070 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 02:57:04,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:04,083 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:57:04,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:57:04,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-20 02:57:04,116 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:69 [2019-11-20 02:57:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:04,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868914870] [2019-11-20 02:57:04,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:04,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 02:57:04,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971909886] [2019-11-20 02:57:04,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:57:04,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:57:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:57:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:57:04,317 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2019-11-20 02:57:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:04,590 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-20 02:57:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:57:04,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 02:57:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:57:04,591 INFO L225 Difference]: With dead ends: 44 [2019-11-20 02:57:04,591 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 02:57:04,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-20 02:57:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 02:57:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 02:57:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 02:57:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-11-20 02:57:04,598 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2019-11-20 02:57:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:57:04,598 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-20 02:57:04,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:57:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-11-20 02:57:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:57:04,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:57:04,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:04,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 02:57:04,814 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:57:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2019-11-20 02:57:04,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:57:04,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847234557] [2019-11-20 02:57:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 02:57:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:04,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:57:04,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:04,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:57:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:04,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847234557] [2019-11-20 02:57:04,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:04,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 02:57:04,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154208232] [2019-11-20 02:57:04,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:57:04,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:57:04,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:57:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:57:04,904 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2019-11-20 02:57:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:04,945 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-20 02:57:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:57:04,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-20 02:57:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:57:04,950 INFO L225 Difference]: With dead ends: 40 [2019-11-20 02:57:04,951 INFO L226 Difference]: Without dead ends: 24 [2019-11-20 02:57:04,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:57:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-20 02:57:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-20 02:57:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 02:57:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-11-20 02:57:04,955 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2019-11-20 02:57:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:57:04,955 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-11-20 02:57:04,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:57:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-11-20 02:57:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:57:04,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:57:04,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:05,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 02:57:05,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:57:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2019-11-20 02:57:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:57:05,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529836607] [2019-11-20 02:57:05,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-20 02:57:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:05,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 02:57:05,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:05,521 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 02:57:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:05,694 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:57:05,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:57:06,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529836607] [2019-11-20 02:57:06,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:06,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-20 02:57:06,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292558834] [2019-11-20 02:57:06,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 02:57:06,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:57:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 02:57:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-20 02:57:06,136 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 16 states. [2019-11-20 02:57:06,776 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-20 02:57:07,635 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-20 02:57:07,891 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-20 02:57:08,165 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-20 02:57:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:08,166 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-20 02:57:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:57:08,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 02:57:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:57:08,166 INFO L225 Difference]: With dead ends: 24 [2019-11-20 02:57:08,166 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 02:57:08,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-20 02:57:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 02:57:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 02:57:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 02:57:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 02:57:08,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-20 02:57:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:57:08,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:57:08,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 02:57:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:57:08,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 02:57:08,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 02:57:08,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 02:57:08,611 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 179 [2019-11-20 02:57:08,906 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-11-20 02:57:09,424 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 38 [2019-11-20 02:57:09,623 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 17 [2019-11-20 02:57:10,192 WARN L191 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 48 [2019-11-20 02:57:10,884 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 29 [2019-11-20 02:57:10,885 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 02:57:10,885 INFO L444 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L440 ceAbstractionStarter]: At program point L60-3(lines 53 61) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_double_~y .cse0) (fp.eq |ULTIMATE.start_fmax_double_#res| ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x .cse0) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))))) [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 80) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L440 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) .cse0)))) [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 02:57:10,886 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2019-11-20 02:57:10,887 INFO L440 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-20 02:57:10,887 INFO L444 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2019-11-20 02:57:10,887 INFO L444 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2019-11-20 02:57:10,887 INFO L440 ceAbstractionStarter]: At program point L29-6(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_double_~y .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-20 02:57:10,887 INFO L444 ceAbstractionStarter]: For program point L29-7(lines 26 51) no Hoare annotation was computed. [2019-11-20 02:57:10,887 INFO L447 ceAbstractionStarter]: At program point L83(lines 63 84) the Hoare annotation is: true [2019-11-20 02:57:10,887 INFO L440 ceAbstractionStarter]: At program point L50(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= ULTIMATE.start_fmax_double_~x (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4))) (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~y .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (or (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)) (and (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32)) (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32))) (= (_ bv0 32) ULTIMATE.start___fpclassify_double_~lsw~0)))) [2019-11-20 02:57:10,887 INFO L440 ceAbstractionStarter]: At program point L50-1(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_skolemized_v_prenex_3_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_7|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_3_3) ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) .cse1)))) (= ULTIMATE.start_fmax_double_~y .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2019-11-20 02:57:10,887 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2019-11-20 02:57:10,887 INFO L444 ceAbstractionStarter]: For program point L46-1(lines 46 50) no Hoare annotation was computed. [2019-11-20 02:57:10,887 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-11-20 02:57:10,888 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2019-11-20 02:57:10,888 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 56) no Hoare annotation was computed. [2019-11-20 02:57:10,888 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 81) no Hoare annotation was computed. [2019-11-20 02:57:10,888 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2019-11-20 02:57:10,888 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 39 50) no Hoare annotation was computed. [2019-11-20 02:57:10,888 INFO L444 ceAbstractionStarter]: For program point L72-2(lines 72 81) no Hoare annotation was computed. [2019-11-20 02:57:10,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,905 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,906 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,909 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:10,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:10,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:10,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,915 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,915 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:10,917 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,917 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,920 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,921 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,921 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,921 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:10,923 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:10,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:57:10 BoogieIcfgContainer [2019-11-20 02:57:10,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:57:10,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:57:10,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:57:10,926 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:57:10,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:19" (3/4) ... [2019-11-20 02:57:10,929 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 02:57:10,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-20 02:57:10,941 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 02:57:10,941 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 02:57:10,967 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) [2019-11-20 02:57:10,967 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && x == x) && x == x) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x) [2019-11-20 02:57:10,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists v_skolemized_v_prenex_2_4 : bv64 :: x == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) && v_skolemized_v_prenex_2_4[63:32] == msw) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && x == x) && x == x) && 0bv32 == \result) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw) [2019-11-20 02:57:10,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2019-11-20 02:57:10,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-20 02:57:10,969 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(x, x)) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result [2019-11-20 02:57:10,991 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1ceecd79-5b6f-4d82-8eb5-6a63acc8d5d7/bin/uautomizer/witness.graphml [2019-11-20 02:57:10,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:57:10,993 INFO L168 Benchmark]: Toolchain (without parser) took 52576.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.4 MB). Free memory was 956.4 MB in the beginning and 886.0 MB in the end (delta: 70.4 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,993 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:57:10,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.38 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 940.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -214.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,995 INFO L168 Benchmark]: Boogie Preprocessor took 29.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,995 INFO L168 Benchmark]: RCFGBuilder took 489.23 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,995 INFO L168 Benchmark]: TraceAbstraction took 51625.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 894.0 MB in the end (delta: 228.3 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,996 INFO L168 Benchmark]: Witness Printer took 66.57 ms. Allocated memory is still 1.3 GB. Free memory was 894.0 MB in the beginning and 886.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:10,998 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.24 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 255.38 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 940.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -214.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 489.23 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51625.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 894.0 MB in the end (delta: 228.3 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. * Witness Printer took 66.57 ms. Allocated memory is still 1.3 GB. Free memory was 894.0 MB in the beginning and 886.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2019-11-20 02:57:11,010 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,011 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 29]: Loop Invariant [2019-11-20 02:57:11,012 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,012 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,012 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,012 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && x == x) && x == x) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x) - InvariantResult [Line: 26]: Loop Invariant [2019-11-20 02:57:11,013 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,014 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:11,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:11,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,015 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,015 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,016 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,017 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 02:57:11,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 02:57:11,018 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,018 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(x, x)) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result - InvariantResult [Line: 29]: Loop Invariant [2019-11-20 02:57:11,019 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,019 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,019 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,019 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,020 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,020 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2019-11-20 02:57:11,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,021 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,021 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 02:57:11,023 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,023 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((\exists v_skolemized_v_prenex_2_4 : bv64 :: x == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) && v_skolemized_v_prenex_2_4[63:32] == msw) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && x == x) && x == x) && 0bv32 == \result) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant [2019-11-20 02:57:11,024 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,024 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,024 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,025 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,026 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,026 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,026 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 02:57:11,026 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 02:57:11,027 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 51.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, HoareTripleCheckerStatistics: 268 SDtfs, 696 SDslu, 493 SDs, 0 SdLazy, 362 SolverSat, 52 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 248 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1078 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12287 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 74 QuantifiedInterpolants, 70804 SizeOfPredicates, 62 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...