./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.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_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 ef69b30587e0c4301fdaba0084db3fa6fe256bc6 ............................................................................................................................................................................................................................................................................................................... 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_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 ef69b30587e0c4301fdaba0084db3fa6fe256bc6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:39:15,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:39:15,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:39:15,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:39:15,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:39:15,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:39:15,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:39:15,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:39:15,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:39:15,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:39:15,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:39:15,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:39:15,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:39:15,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:39:15,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:39:15,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:39:15,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:39:15,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:39:15,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:39:15,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:39:15,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:39:15,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:39:15,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:39:15,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:39:15,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:39:15,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:39:15,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:39:15,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:39:15,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:39:15,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:39:15,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:39:15,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:39:15,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:39:15,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:39:15,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:39:15,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:39:15,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:39:15,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:39:15,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:39:15,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:39:15,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:39:15,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:39:15,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:39:15,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:39:15,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:39:15,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:39:15,742 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:39:15,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:39:15,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:39:15,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:39:15,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:39:15,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:39:15,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:39:15,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:39:15,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:39:15,743 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:39:15,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:39:15,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:39:15,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:39:15,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:39:15,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:39:15,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:39:15,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:39:15,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:39:15,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:39:15,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:39:15,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:39:15,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:39:15,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:39:15,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:39:15,746 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_06772205-de8a-4609-9145-ae04bb3eb7b6/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 -> ef69b30587e0c4301fdaba0084db3fa6fe256bc6 [2019-11-20 00:39:15,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:39:15,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:39:15,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:39:15,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:39:15,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:39:15,904 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-11-20 00:39:15,957 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/0766b5dad/ffb023bb556c4b2cbc512cc9b1e336c0/FLAG9fc2e8412 [2019-11-20 00:39:16,393 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:39:16,396 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-11-20 00:39:16,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/0766b5dad/ffb023bb556c4b2cbc512cc9b1e336c0/FLAG9fc2e8412 [2019-11-20 00:39:16,742 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/0766b5dad/ffb023bb556c4b2cbc512cc9b1e336c0 [2019-11-20 00:39:16,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:39:16,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:39:16,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:39:16,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:39:16,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:39:16,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:39:16" (1/1) ... [2019-11-20 00:39:16,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea47149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:16, skipping insertion in model container [2019-11-20 00:39:16,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:39:16" (1/1) ... [2019-11-20 00:39:16,761 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:39:16,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:39:17,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:39:17,121 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:39:17,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:39:17,176 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:39:17,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17 WrapperNode [2019-11-20 00:39:17,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:39:17,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:39:17,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:39:17,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:39:17,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:39:17,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:39:17,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:39:17,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:39:17,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... [2019-11-20 00:39:17,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:39:17,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:39:17,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:39:17,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:39:17,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 00:39:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:39:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 00:39:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:39:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 00:39:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:39:17,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:39:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:39:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 00:39:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:39:17,708 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:39:17,708 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 00:39:17,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:39:17 BoogieIcfgContainer [2019-11-20 00:39:17,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:39:17,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:39:17,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:39:17,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:39:17,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:39:16" (1/3) ... [2019-11-20 00:39:17,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754e14b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:39:17, skipping insertion in model container [2019-11-20 00:39:17,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:17" (2/3) ... [2019-11-20 00:39:17,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754e14b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:39:17, skipping insertion in model container [2019-11-20 00:39:17,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:39:17" (3/3) ... [2019-11-20 00:39:17,716 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621a.c [2019-11-20 00:39:17,725 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:39:17,731 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:39:17,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:39:17,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:39:17,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:39:17,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:39:17,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:39:17,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:39:17,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:39:17,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:39:17,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:39:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-20 00:39:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 00:39:17,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:39:17,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:39:17,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:39:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:39:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-11-20 00:39:17,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:39:17,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362497409] [2019-11-20 00:39:17,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:39:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:39:17,919 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 00:39:17,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362497409] [2019-11-20 00:39:17,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:39:17,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:39:17,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088959403] [2019-11-20 00:39:17,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:39:17,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:39:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:39:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:39:17,937 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-11-20 00:39:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:39:17,956 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-11-20 00:39:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:39:17,957 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 00:39:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:39:17,965 INFO L225 Difference]: With dead ends: 66 [2019-11-20 00:39:17,965 INFO L226 Difference]: Without dead ends: 31 [2019-11-20 00:39:17,968 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 00:39:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-20 00:39:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-20 00:39:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 00:39:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-20 00:39:17,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-11-20 00:39:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:39:17,996 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-20 00:39:17,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:39:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-11-20 00:39:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 00:39:17,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:39:17,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:39:17,998 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:39:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:39:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-11-20 00:39:17,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:39:17,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625103012] [2019-11-20 00:39:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:39:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:39:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:39:18,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:39:18,136 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:39:18,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:39:18 BoogieIcfgContainer [2019-11-20 00:39:18,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:39:18,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:39:18,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:39:18,171 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:39:18,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:39:17" (3/4) ... [2019-11-20 00:39:18,175 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:39:18,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:39:18,177 INFO L168 Benchmark]: Toolchain (without parser) took 1430.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -119.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:39:18,178 INFO L168 Benchmark]: CDTParser took 0.27 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 00:39:18,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:39:18,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.72 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:39:18,179 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:39:18,180 INFO L168 Benchmark]: RCFGBuilder took 456.49 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:39:18,181 INFO L168 Benchmark]: TraceAbstraction took 459.50 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:39:18,181 INFO L168 Benchmark]: Witness Printer took 4.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:39:18,184 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.27 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 429.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.72 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.49 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 459.50 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 145]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of bitwiseAnd at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L141] double x = 1.0 / 0.0; [L65] double w, s1, s2, z; [L66] __int32_t ix, hx, id; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L69] ieee_double_shape_type gh_u; [L70] gh_u.value = (x) [L71] EXPR gh_u.parts.msw [L71] (hx) = gh_u.parts.msw [L73] ix = hx & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L74] COND TRUE ix >= 0x44100000 [L75] __uint32_t low; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L77] ieee_double_shape_type gl_u; [L78] gl_u.value = (x) [L79] EXPR gl_u.parts.lsw [L79] (low) = gl_u.parts.lsw [L81] COND TRUE ix > 0x7ff00000 || (ix == 0x7ff00000 && (low != 0)) [L82] return x + x; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L142] double res = atan_double(x); [L144] COND TRUE res != pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L145] __VERIFIER_error() VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 00:39:20,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:39:20,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:39:20,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:39:20,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:39:20,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:39:20,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:39:20,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:39:20,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:39:20,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:39:20,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:39:20,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:39:20,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:39:20,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:39:20,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:39:20,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:39:20,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:39:20,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:39:20,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:39:20,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:39:20,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:39:20,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:39:20,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:39:20,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:39:20,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:39:20,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:39:20,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:39:20,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:39:20,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:39:20,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:39:20,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:39:20,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:39:20,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:39:20,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:39:20,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:39:20,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:39:20,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:39:20,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:39:20,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:39:20,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:39:20,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:39:20,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 00:39:20,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:39:20,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:39:20,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:39:20,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:39:20,085 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:39:20,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:39:20,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:39:20,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:39:20,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:39:20,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:39:20,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:39:20,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:39:20,086 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:39:20,087 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:39:20,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:39:20,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:39:20,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:39:20,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:39:20,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:39:20,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:39:20,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:39:20,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:39:20,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:39:20,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:39:20,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:39:20,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:39:20,089 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:39:20,089 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:39:20,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:39:20,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:39:20,090 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_06772205-de8a-4609-9145-ae04bb3eb7b6/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 -> ef69b30587e0c4301fdaba0084db3fa6fe256bc6 [2019-11-20 00:39:20,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:39:20,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:39:20,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:39:20,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:39:20,384 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:39:20,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-11-20 00:39:20,442 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/8f90b6aa2/6ed9e092d2bb400f8735ac4207c945b9/FLAGafdc02dd4 [2019-11-20 00:39:20,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:39:20,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-11-20 00:39:20,868 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/8f90b6aa2/6ed9e092d2bb400f8735ac4207c945b9/FLAGafdc02dd4 [2019-11-20 00:39:21,281 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/bin/uautomizer/data/8f90b6aa2/6ed9e092d2bb400f8735ac4207c945b9 [2019-11-20 00:39:21,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:39:21,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:39:21,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:39:21,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:39:21,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:39:21,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66604a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21, skipping insertion in model container [2019-11-20 00:39:21,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,298 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:39:21,318 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:39:21,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:39:21,546 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:39:21,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:39:21,677 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:39:21,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21 WrapperNode [2019-11-20 00:39:21,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:39:21,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:39:21,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:39:21,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:39:21,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:39:21,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:39:21,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:39:21,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:39:21,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... [2019-11-20 00:39:21,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:39:21,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:39:21,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:39:21,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:39:21,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 00:39:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 00:39:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 00:39:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:39:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 00:39:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:39:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:39:21,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:39:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:39:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:39:39,275 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:39:39,276 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 00:39:39,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:39:39 BoogieIcfgContainer [2019-11-20 00:39:39,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:39:39,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:39:39,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:39:39,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:39:39,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:39:21" (1/3) ... [2019-11-20 00:39:39,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d59c78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:39:39, skipping insertion in model container [2019-11-20 00:39:39,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:39:21" (2/3) ... [2019-11-20 00:39:39,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d59c78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:39:39, skipping insertion in model container [2019-11-20 00:39:39,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:39:39" (3/3) ... [2019-11-20 00:39:39,287 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621a.c [2019-11-20 00:39:39,297 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:39:39,306 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:39:39,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:39:39,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:39:39,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:39:39,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:39:39,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:39:39,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:39:39,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:39:39,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:39:39,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:39:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-20 00:39:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 00:39:39,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:39:39,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:39:39,366 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:39:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:39:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-11-20 00:39:39,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:39:39,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050991146] [2019-11-20 00:39:39,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 00:39:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:39:39,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 00:39:39,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:39:39,831 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 00:39:39,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:39:39,834 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 00:39:39,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050991146] [2019-11-20 00:39:39,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:39:39,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 00:39:39,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622427850] [2019-11-20 00:39:39,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:39:39,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:39:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:39:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:39:39,855 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-11-20 00:39:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:39:39,875 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-11-20 00:39:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:39:39,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 00:39:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:39:39,887 INFO L225 Difference]: With dead ends: 66 [2019-11-20 00:39:39,887 INFO L226 Difference]: Without dead ends: 31 [2019-11-20 00:39:39,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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 00:39:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-20 00:39:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-20 00:39:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 00:39:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-20 00:39:39,925 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-11-20 00:39:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:39:39,925 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-20 00:39:39,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:39:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-11-20 00:39:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 00:39:39,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:39:39,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:39:40,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 00:39:40,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:39:40,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:39:40,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-11-20 00:39:40,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:39:40,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637146041] [2019-11-20 00:39:40,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 00:39:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:39:40,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 00:39:40,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:39:40,636 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 00:39:40,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:39:40,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:40,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:41,028 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 00:39:41,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637146041] [2019-11-20 00:39:41,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:39:41,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 00:39:41,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717267917] [2019-11-20 00:39:41,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:39:41,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:39:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:39:41,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:39:41,033 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 10 states. [2019-11-20 00:39:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:39:41,438 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-11-20 00:39:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:39:41,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-20 00:39:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:39:41,447 INFO L225 Difference]: With dead ends: 35 [2019-11-20 00:39:41,447 INFO L226 Difference]: Without dead ends: 14 [2019-11-20 00:39:41,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:39:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-20 00:39:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 00:39:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 00:39:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-11-20 00:39:41,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2019-11-20 00:39:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:39:41,454 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-11-20 00:39:41,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:39:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-11-20 00:39:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 00:39:41,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:39:41,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:39:41,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 00:39:41,676 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:39:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:39:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1317358715, now seen corresponding path program 1 times [2019-11-20 00:39:41,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:39:41,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862522851] [2019-11-20 00:39:41,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06772205-de8a-4609-9145-ae04bb3eb7b6/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 00:39:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:39:42,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 00:39:42,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:39:42,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:42,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:42,601 INFO L343 Elim1Store]: treesize reduction 57, result has 38.7 percent of original size [2019-11-20 00:39:42,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 70 [2019-11-20 00:39:42,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:42,812 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-20 00:39:42,813 INFO L567 ElimStorePlain]: treesize reduction 22, result has 83.9 percent of original size [2019-11-20 00:39:42,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:39:42,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 00:39:42,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:110, output treesize:115 [2019-11-20 00:39:42,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:39:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:39:42,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:39:43,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:43,288 INFO L237 Elim1Store]: Index analysis took 225 ms [2019-11-20 00:39:43,545 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 00:39:43,546 INFO L343 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-11-20 00:39:43,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 208 [2019-11-20 00:39:43,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:43,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:43,725 INFO L237 Elim1Store]: Index analysis took 138 ms [2019-11-20 00:39:43,906 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 00:39:43,907 INFO L343 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-11-20 00:39:43,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 203 [2019-11-20 00:39:43,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:43,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:44,098 INFO L237 Elim1Store]: Index analysis took 148 ms [2019-11-20 00:39:44,296 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 00:39:44,296 INFO L343 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-11-20 00:39:44,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 208 [2019-11-20 00:39:44,300 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:44,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:44,697 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-11-20 00:39:44,698 INFO L343 Elim1Store]: treesize reduction 32, result has 77.3 percent of original size [2019-11-20 00:39:44,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 138 treesize of output 235 [2019-11-20 00:39:44,701 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:46,906 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-11-20 00:39:46,907 INFO L567 ElimStorePlain]: treesize reduction 174, result has 76.0 percent of original size [2019-11-20 00:39:46,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:46,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,043 INFO L237 Elim1Store]: Index analysis took 101 ms [2019-11-20 00:39:47,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:47,184 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:47,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 192 [2019-11-20 00:39:47,187 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:47,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:47,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:47,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 181 [2019-11-20 00:39:47,418 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:47,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,605 INFO L237 Elim1Store]: Index analysis took 139 ms [2019-11-20 00:39:47,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:47,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:47,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 194 [2019-11-20 00:39:47,749 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:47,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:47,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:47,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:47,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 192 [2019-11-20 00:39:47,909 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:49,294 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2019-11-20 00:39:49,295 INFO L567 ElimStorePlain]: treesize reduction 235, result has 70.1 percent of original size [2019-11-20 00:39:49,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 4 xjuncts. [2019-11-20 00:39:49,303 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:542, output treesize:552 [2019-11-20 00:39:49,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,794 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2019-11-20 00:39:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:49,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:39:50,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:50,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:51,112 INFO L237 Elim1Store]: Index analysis took 396 ms [2019-11-20 00:39:51,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:51,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 193 [2019-11-20 00:39:51,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:51,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:51,473 INFO L237 Elim1Store]: Index analysis took 222 ms [2019-11-20 00:39:51,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:51,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 193 [2019-11-20 00:39:51,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:51,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:51,779 INFO L237 Elim1Store]: Index analysis took 192 ms [2019-11-20 00:39:51,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:51,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 146 treesize of output 192 [2019-11-20 00:39:51,839 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:52,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:52,162 INFO L237 Elim1Store]: Index analysis took 237 ms [2019-11-20 00:39:52,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:52,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 157 treesize of output 233 [2019-11-20 00:39:52,264 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:53,640 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 244 [2019-11-20 00:39:53,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:53,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:53,833 INFO L237 Elim1Store]: Index analysis took 157 ms [2019-11-20 00:39:53,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:53,995 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 00:39:53,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:53,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 220 [2019-11-20 00:39:53,998 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:54,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:54,299 INFO L237 Elim1Store]: Index analysis took 263 ms [2019-11-20 00:39:54,384 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:54,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:54,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 140 treesize of output 211 [2019-11-20 00:39:54,469 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:54,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:54,709 INFO L237 Elim1Store]: Index analysis took 192 ms [2019-11-20 00:39:54,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:54,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:54,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 140 treesize of output 211 [2019-11-20 00:39:54,869 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:54,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:54,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:39:54,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:39:55,087 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:39:55,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 208 [2019-11-20 00:39:55,089 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 00:39:57,850 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 298 DAG size of output: 250 [2019-11-20 00:39:57,850 INFO L567 ElimStorePlain]: treesize reduction 272, result has 67.6 percent of original size [2019-11-20 00:39:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 29 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 35 dim-0 vars, and 4 xjuncts. [2019-11-20 00:39:57,863 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 31 variables, input treesize:614, output treesize:567 [2019-11-20 00:39:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:39:57,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:01,349 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 306 DAG size of output: 96 [2019-11-20 00:40:01,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:03,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:06,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:06,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:40:06,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:40:06,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 174 [2019-11-20 00:40:06,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:06,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:06,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:06,524 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:40:07,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:40:07,858 INFO L237 Elim1Store]: Index analysis took 1316 ms [2019-11-20 00:40:10,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:40:10,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 216 treesize of output 198 [2019-11-20 00:40:10,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:10,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:10,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:10,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:10,364 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:40:29,323 WARN L191 SmtUtils]: Spent 18.96 s on a formula simplification. DAG size of input: 115 DAG size of output: 106 [2019-11-20 00:40:29,324 INFO L567 ElimStorePlain]: treesize reduction 70, result has 80.4 percent of original size [2019-11-20 00:40:29,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:40:29,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:40:29,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 17 dim-0 vars, and 2 xjuncts. [2019-11-20 00:40:29,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:413, output treesize:450 [2019-11-20 00:40:37,621 WARN L191 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 216 DAG size of output: 38 [2019-11-20 00:40:39,221 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 00:40:39,337 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 00:40:39,337 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:40:42,915 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 00:40:45,721 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 00:40:54,242 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 00:40:54,245 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 00:40:54,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862522851] [2019-11-20 00:40:54,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:40:54,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 00:40:54,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722964284] [2019-11-20 00:40:54,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 00:40:54,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:40:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 00:40:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2019-11-20 00:40:54,247 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 12 states. [2019-11-20 00:41:16,233 WARN L191 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 289 DAG size of output: 289 [2019-11-20 00:41:24,474 WARN L191 SmtUtils]: Spent 7.46 s on a formula simplification. DAG size of input: 293 DAG size of output: 293 [2019-11-20 00:41:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:41:24,476 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-11-20 00:41:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:41:24,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-11-20 00:41:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:41:24,477 INFO L225 Difference]: With dead ends: 14 [2019-11-20 00:41:24,477 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:41:24,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=55, Invalid=123, Unknown=4, NotChecked=0, Total=182 [2019-11-20 00:41:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:41:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:41:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:41:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:41:24,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-11-20 00:41:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:41:24,480 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:41:24,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 00:41:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:41:24,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:41:24,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 00:41:24,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:41:28,047 WARN L191 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 324 [2019-11-20 00:41:28,570 WARN L191 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 297 [2019-11-20 00:41:28,632 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-20 00:41:28,632 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-20 00:41:28,632 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 147) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-20 00:41:28,633 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 00:41:28,634 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 00:41:28,634 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-20 00:41:28,634 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-20 00:41:28,635 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: (and (let ((.cse6 (select |#valid| (_ bv0 32))) (.cse0 (= |~#atanhi_atan~0.offset| (_ bv0 32))) (.cse1 (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (.cse14 (= |~#atanlo_atan~0.base| (_ bv0 32)))) (or (and .cse0 .cse1 (exists ((v_prenex_27 (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_27) (select .cse2 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_prenex_27) ((_ extract 62 52) v_prenex_27) ((_ extract 51 0) v_prenex_27)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ((_ extract 63 32) v_prenex_27) (select .cse2 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))))))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32)) (v_prenex_22 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64)) (v_prenex_28 (_ BitVec 64))) (let ((.cse3 (= v_prenex_24 |~#atanlo_atan~0.base|)) (.cse5 (= v_prenex_24 v_prenex_23)) (.cse4 (select |#memory_int| v_prenex_24))) (and (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_25) ((_ extract 62 52) v_prenex_25) ((_ extract 51 0) v_prenex_25))) (not .cse3) (= (select .cse4 (_ bv0 32)) ((_ extract 31 0) v_prenex_28)) (or (= (bvadd (select |#valid| v_prenex_23) (_ bv1 1)) (_ bv0 1)) .cse5) (not (= v_prenex_23 |~#atanlo_atan~0.base|)) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse3) (not .cse5) (= (select |#valid| v_prenex_24) (_ bv0 1)) (= ((_ extract 63 32) v_prenex_22) (select .cse4 (_ bv4 32))) (= ((_ extract 63 32) v_prenex_25) (select (select |#memory_int| v_prenex_23) (_ bv28 32)))))) (exists ((v_prenex_26 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_26)) (= (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) (= (_ bv0 32) |~#atanhi_atan~0.base|)) (and .cse0 (exists ((v_prenex_33 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_33)) (= (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) .cse1 (= (_ bv0 1) .cse6) (exists ((v_prenex_34 (_ BitVec 64))) (let ((.cse7 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_34) (select .cse7 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_34) (select .cse7 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= (fp ((_ extract 63 63) v_prenex_34) ((_ extract 62 52) v_prenex_34) ((_ extract 51 0) v_prenex_34)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)))))) (exists ((v_prenex_32 (_ BitVec 64)) (v_prenex_30 (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_prenex_35 (_ BitVec 64)) (v_prenex_29 (_ BitVec 64))) (let ((.cse8 (= v_prenex_31 |~#atanlo_atan~0.base|)) (.cse9 (select |#memory_int| v_prenex_31)) (.cse10 (= v_prenex_31 v_prenex_30))) (and (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse8) (= (select |#valid| v_prenex_31) (_ bv0 1)) (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_32) ((_ extract 62 52) v_prenex_32) ((_ extract 51 0) v_prenex_32))) (= ((_ extract 63 32) v_prenex_32) (select (select |#memory_int| v_prenex_30) (_ bv28 32))) (= ((_ extract 63 32) v_prenex_29) (select .cse9 (_ bv4 32))) (or .cse10 (= (bvadd (select |#valid| v_prenex_30) (_ bv1 1)) (_ bv0 1))) (not .cse8) (= (select .cse9 (_ bv0 32)) ((_ extract 31 0) v_prenex_35)) (not .cse10) (not (= v_prenex_30 |~#atanlo_atan~0.base|)))))) (and (= (_ bv1 1) .cse6) .cse0 (exists ((v_prenex_38 (_ BitVec 32)) (v_prenex_36 (_ BitVec 64)) (v_prenex_37 (_ BitVec 64))) (let ((.cse11 (select |#memory_int| v_prenex_38)) (.cse12 (= v_prenex_38 |~#atanlo_atan~0.base|))) (and (= ((_ extract 63 32) v_prenex_37) (select .cse11 (_ bv4 32))) (not .cse12) (= (select |#valid| v_prenex_38) (_ bv0 1)) (= (select .cse11 (_ bv0 32)) ((_ extract 31 0) v_prenex_36)) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse12)))) (exists ((v_prenex_40 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_40)) (= (fp ((_ extract 63 63) v_prenex_40) ((_ extract 62 52) v_prenex_40) ((_ extract 51 0) v_prenex_40)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) .cse1 (exists ((v_prenex_39 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_39) ((_ extract 62 52) v_prenex_39) ((_ extract 51 0) v_prenex_39))) (= (select (select |#memory_int| (_ bv0 32)) (_ bv28 32)) ((_ extract 63 32) v_prenex_39)))) (exists ((v_prenex_41 (_ BitVec 64))) (let ((.cse13 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_prenex_41) (select .cse13 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= (fp ((_ extract 63 63) v_prenex_41) ((_ extract 62 52) v_prenex_41) ((_ extract 51 0) v_prenex_41)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ((_ extract 31 0) v_prenex_41) (select .cse13 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))))))) (not .cse14)) (and .cse0 (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_13_3)))) .cse1 .cse14 (exists ((v_skolemized_v_prenex_19_4 (_ BitVec 64)) (|~#aT_atan~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32)) (v_skolemized_v_prenex_10_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64))) (let ((.cse15 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse17 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#aT_atan~0.base|)) (.cse16 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse15) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse15) (= ((_ extract 63 32) v_skolemized_v_prenex_19_4) (select .cse16 (_ bv4 32))) (or .cse17 (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_10_3) ((_ extract 62 52) v_skolemized_v_prenex_10_3) ((_ extract 51 0) v_skolemized_v_prenex_10_3))) (not .cse17) (= ((_ extract 63 32) v_skolemized_v_prenex_10_3) (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv28 32))) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= (select .cse16 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_12|)) (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|))))) (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse18 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select .cse18 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_skolemized_v_prenex_12_3) (select .cse18 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))))))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x))) (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64)) (v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= (let ((.cse20 ((_ extract 63 32) v_skolemized_v_prenex_12_3))) (fp.add roundNearestTiesToEven (let ((.cse19 (concat .cse20 ((_ extract 31 0) v_skolemized_v_prenex_12_3)))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))) (let ((.cse21 (concat ((_ extract 63 32) v_skolemized_v_prenex_13_3) .cse20))) (fp ((_ extract 63 63) .cse21) ((_ extract 62 52) .cse21) ((_ extract 51 0) .cse21))))) |ULTIMATE.start_atan_double_#res|) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))) (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|) ULTIMATE.start_atan_double_~low~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ULTIMATE.start_atan_double_~x (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0)))) [2019-11-20 00:41:28,635 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-20 00:41:28,636 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:41:28,637 INFO L447 ceAbstractionStarter]: At program point L148(lines 134 149) the Hoare annotation is: true [2019-11-20 00:41:28,637 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-20 00:41:28,637 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:41:28,637 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-20 00:41:28,637 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-20 00:41:28,638 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x))) (let ((.cse12 (select |#valid| (_ bv0 32))) (.cse0 (= |~#atanhi_atan~0.offset| (_ bv0 32))) (.cse1 (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (.cse3 (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)))) (.cse2 (= |~#atanlo_atan~0.base| (_ bv0 32)))) (or (and .cse0 (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_13_3)))) .cse1 .cse2 .cse3 (exists ((v_skolemized_v_prenex_19_4 (_ BitVec 64)) (|~#aT_atan~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32)) (v_skolemized_v_prenex_10_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64))) (let ((.cse4 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse6 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#aT_atan~0.base|)) (.cse5 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse4) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse4) (= ((_ extract 63 32) v_skolemized_v_prenex_19_4) (select .cse5 (_ bv4 32))) (or .cse6 (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_10_3) ((_ extract 62 52) v_skolemized_v_prenex_10_3) ((_ extract 51 0) v_skolemized_v_prenex_10_3))) (not .cse6) (= ((_ extract 63 32) v_skolemized_v_prenex_10_3) (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv28 32))) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= (select .cse5 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_12|)) (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|))))) (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse7 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select .cse7 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_skolemized_v_prenex_12_3) (select .cse7 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))))) (and .cse0 .cse1 .cse3 (exists ((v_prenex_27 (_ BitVec 64))) (let ((.cse8 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_27) (select .cse8 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_prenex_27) ((_ extract 62 52) v_prenex_27) ((_ extract 51 0) v_prenex_27)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ((_ extract 63 32) v_prenex_27) (select .cse8 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))))))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32)) (v_prenex_22 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64)) (v_prenex_28 (_ BitVec 64))) (let ((.cse9 (= v_prenex_24 |~#atanlo_atan~0.base|)) (.cse11 (= v_prenex_24 v_prenex_23)) (.cse10 (select |#memory_int| v_prenex_24))) (and (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_25) ((_ extract 62 52) v_prenex_25) ((_ extract 51 0) v_prenex_25))) (not .cse9) (= (select .cse10 (_ bv0 32)) ((_ extract 31 0) v_prenex_28)) (or (= (bvadd (select |#valid| v_prenex_23) (_ bv1 1)) (_ bv0 1)) .cse11) (not (= v_prenex_23 |~#atanlo_atan~0.base|)) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse9) (not .cse11) (= (select |#valid| v_prenex_24) (_ bv0 1)) (= ((_ extract 63 32) v_prenex_22) (select .cse10 (_ bv4 32))) (= ((_ extract 63 32) v_prenex_25) (select (select |#memory_int| v_prenex_23) (_ bv28 32)))))) (exists ((v_prenex_26 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_26)) (= (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) (= (_ bv0 32) |~#atanhi_atan~0.base|)) (and .cse0 (exists ((v_prenex_33 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_33)) (= (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) .cse1 (= (_ bv0 1) .cse12) (exists ((v_prenex_34 (_ BitVec 64))) (let ((.cse13 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_34) (select .cse13 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_34) (select .cse13 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= (fp ((_ extract 63 63) v_prenex_34) ((_ extract 62 52) v_prenex_34) ((_ extract 51 0) v_prenex_34)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)))))) .cse3 (exists ((v_prenex_32 (_ BitVec 64)) (v_prenex_30 (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_prenex_35 (_ BitVec 64)) (v_prenex_29 (_ BitVec 64))) (let ((.cse14 (= v_prenex_31 |~#atanlo_atan~0.base|)) (.cse15 (select |#memory_int| v_prenex_31)) (.cse16 (= v_prenex_31 v_prenex_30))) (and (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse14) (= (select |#valid| v_prenex_31) (_ bv0 1)) (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_32) ((_ extract 62 52) v_prenex_32) ((_ extract 51 0) v_prenex_32))) (= ((_ extract 63 32) v_prenex_32) (select (select |#memory_int| v_prenex_30) (_ bv28 32))) (= ((_ extract 63 32) v_prenex_29) (select .cse15 (_ bv4 32))) (or .cse16 (= (bvadd (select |#valid| v_prenex_30) (_ bv1 1)) (_ bv0 1))) (not .cse14) (= (select .cse15 (_ bv0 32)) ((_ extract 31 0) v_prenex_35)) (not .cse16) (not (= v_prenex_30 |~#atanlo_atan~0.base|)))))) (and (= (_ bv1 1) .cse12) .cse0 (exists ((v_prenex_38 (_ BitVec 32)) (v_prenex_36 (_ BitVec 64)) (v_prenex_37 (_ BitVec 64))) (let ((.cse17 (select |#memory_int| v_prenex_38)) (.cse18 (= v_prenex_38 |~#atanlo_atan~0.base|))) (and (= ((_ extract 63 32) v_prenex_37) (select .cse17 (_ bv4 32))) (not .cse18) (= (select |#valid| v_prenex_38) (_ bv0 1)) (= (select .cse17 (_ bv0 32)) ((_ extract 31 0) v_prenex_36)) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse18)))) (exists ((v_prenex_40 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_40)) (= (fp ((_ extract 63 63) v_prenex_40) ((_ extract 62 52) v_prenex_40) ((_ extract 51 0) v_prenex_40)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) .cse1 (exists ((v_prenex_39 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_39) ((_ extract 62 52) v_prenex_39) ((_ extract 51 0) v_prenex_39))) (= (select (select |#memory_int| (_ bv0 32)) (_ bv28 32)) ((_ extract 63 32) v_prenex_39)))) (exists ((v_prenex_41 (_ BitVec 64))) (let ((.cse19 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_prenex_41) (select .cse19 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= (fp ((_ extract 63 63) v_prenex_41) ((_ extract 62 52) v_prenex_41) ((_ extract 51 0) v_prenex_41)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ((_ extract 31 0) v_prenex_41) (select .cse19 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))))))) .cse3 (not .cse2)))) (= ULTIMATE.start_atan_double_~x (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0)))) [2019-11-20 00:41:28,638 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-20 00:41:28,638 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-20 00:41:28,639 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: (and (= |~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_13_3)))) (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_10_3 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 2777777601365588947.0 25000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_10_3) ((_ extract 62 52) v_skolemized_v_prenex_10_3) ((_ extract 51 0) v_skolemized_v_prenex_10_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_10_3) (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv28 32))) (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#atanlo_atan~0.base| (_ bv0 32)) (= (_ bv0 32) |~#atanhi_atan~0.base|) (= |~#aT_atan~0.base| (_ bv0 32))) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ULTIMATE.start_atan_double_~x (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_skolemized_v_prenex_12_3) (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))))) [2019-11-20 00:41:28,652 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 00:41:28,656 INFO L168 Benchmark]: Toolchain (without parser) took 127371.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 955.1 MB in the beginning and 1.3 GB in the end (delta: -297.5 MB). Peak memory consumption was 379.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:41:28,657 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:41:28,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:41:28,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:41:28,658 INFO L168 Benchmark]: Boogie Preprocessor took 40.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:41:28,659 INFO L168 Benchmark]: RCFGBuilder took 17510.34 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:41:28,660 INFO L168 Benchmark]: TraceAbstraction took 109376.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -145.2 MB). Peak memory consumption was 374.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:41:28,663 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17510.34 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109376.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -145.2 MB). Peak memory consumption was 374.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...