./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/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_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/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.25-f470102 [2019-12-07 10:17:07,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:17:07,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:17:07,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:17:07,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:17:07,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:17:07,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:17:07,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:17:07,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:17:07,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:17:07,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:17:07,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:17:07,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:17:07,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:17:07,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:17:07,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:17:07,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:17:07,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:17:07,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:17:07,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:17:07,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:17:07,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:17:07,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:17:07,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:17:07,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:17:07,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:17:07,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:17:07,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:17:07,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:17:07,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:17:07,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:17:07,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:17:07,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:17:07,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:17:07,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:17:07,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:17:07,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:17:07,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:17:07,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:17:07,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:17:07,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:17:07,236 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:17:07,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:17:07,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:17:07,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:17:07,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:17:07,249 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:17:07,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:17:07,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:17:07,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:17:07,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:17:07,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:17:07,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:17:07,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:17:07,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:17:07,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:17:07,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:17:07,251 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:17:07,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:17:07,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:17:07,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:17:07,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:17:07,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:17:07,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:17:07,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:17:07,253 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_9db15683-0cd2-4fd5-9d8d-7897e94786c0/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-12-07 10:17:07,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:17:07,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:17:07,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:17:07,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:17:07,368 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:17:07,368 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-12-07 10:17:07,408 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/2df53fb3c/44f7cce3dbcb48a2916a8f1a543bc31c/FLAG7e48412f5 [2019-12-07 10:17:07,815 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:17:07,816 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-12-07 10:17:07,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/2df53fb3c/44f7cce3dbcb48a2916a8f1a543bc31c/FLAG7e48412f5 [2019-12-07 10:17:08,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/2df53fb3c/44f7cce3dbcb48a2916a8f1a543bc31c [2019-12-07 10:17:08,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:17:08,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:17:08,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:17:08,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:17:08,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:17:08,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275f1801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08, skipping insertion in model container [2019-12-07 10:17:08,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:17:08,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:17:08,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:17:08,396 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:17:08,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:17:08,437 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:17:08,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08 WrapperNode [2019-12-07 10:17:08,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:17:08,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:17:08,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:17:08,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:17:08,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:17:08,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:17:08,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:17:08,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:17:08,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... [2019-12-07 10:17:08,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:17:08,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:17:08,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:17:08,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:17:08,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:17:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:17:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-12-07 10:17:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:17:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-12-07 10:17:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:17:08,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:17:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:17:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-12-07 10:17:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:17:08,767 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:17:08,767 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 10:17:08,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:08 BoogieIcfgContainer [2019-12-07 10:17:08,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:17:08,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:17:08,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:17:08,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:17:08,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:17:08" (1/3) ... [2019-12-07 10:17:08,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a2d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:17:08, skipping insertion in model container [2019-12-07 10:17:08,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:08" (2/3) ... [2019-12-07 10:17:08,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a2d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:17:08, skipping insertion in model container [2019-12-07 10:17:08,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:08" (3/3) ... [2019-12-07 10:17:08,772 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621a.c [2019-12-07 10:17:08,778 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:17:08,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:17:08,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:17:08,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:17:08,805 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:17:08,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:17:08,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:17:08,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:17:08,806 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:17:08,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:17:08,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:17:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-12-07 10:17:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:17:08,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:08,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:08,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-12-07 10:17:08,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:08,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337749875] [2019-12-07 10:17:08,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:08,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337749875] [2019-12-07 10:17:08,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:17:08,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:17:08,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762425913] [2019-12-07 10:17:08,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:17:08,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:17:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:17:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:17:08,944 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-12-07 10:17:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:08,956 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-12-07 10:17:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:17:08,957 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 10:17:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:08,964 INFO L225 Difference]: With dead ends: 66 [2019-12-07 10:17:08,964 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 10:17:08,966 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-12-07 10:17:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 10:17:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 10:17:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:17:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-12-07 10:17:08,989 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-12-07 10:17:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-12-07 10:17:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:17:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-12-07 10:17:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:17:08,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:08,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:08,991 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:08,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-12-07 10:17:08,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:08,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801555983] [2019-12-07 10:17:08,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:17:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:17:09,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:17:09,102 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:17:09,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:17:09 BoogieIcfgContainer [2019-12-07 10:17:09,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:17:09,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:17:09,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:17:09,127 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:17:09,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:08" (3/4) ... [2019-12-07 10:17:09,130 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:17:09,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:17:09,131 INFO L168 Benchmark]: Toolchain (without parser) took 936.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 939.8 MB in the beginning and 1.0 GB in the end (delta: -78.9 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:17:09,132 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:17:09,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:17:09,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:17:09,133 INFO L168 Benchmark]: Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:17:09,133 INFO L168 Benchmark]: RCFGBuilder took 272.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:17:09,134 INFO L168 Benchmark]: TraceAbstraction took 358.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:17:09,134 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:17:09,136 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 272.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 358.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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.2s, 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.25-f470102 [2019-12-07 10:17:10,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:17:10,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:17:10,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:17:10,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:17:10,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:17:10,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:17:10,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:17:10,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:17:10,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:17:10,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:17:10,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:17:10,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:17:10,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:17:10,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:17:10,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:17:10,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:17:10,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:17:10,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:17:10,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:17:10,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:17:10,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:17:10,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:17:10,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:17:10,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:17:10,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:17:10,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:17:10,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:17:10,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:17:10,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:17:10,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:17:10,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:17:10,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:17:10,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:17:10,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:17:10,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:17:10,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:17:10,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:17:10,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:17:10,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:17:10,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:17:10,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:17:10,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:17:10,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:17:10,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:17:10,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:17:10,552 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:17:10,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:17:10,552 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:17:10,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:17:10,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:17:10,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:17:10,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:17:10,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:17:10,553 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:17:10,553 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:17:10,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:17:10,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:17:10,554 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:17:10,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:17:10,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:17:10,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:17:10,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:17:10,555 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:17:10,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:17:10,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:17:10,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:17:10,556 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_9db15683-0cd2-4fd5-9d8d-7897e94786c0/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-12-07 10:17:10,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:17:10,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:17:10,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:17:10,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:17:10,728 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:17:10,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-12-07 10:17:10,765 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/5e0454d33/5ece411040594baab5c1ec055966b035/FLAGa10b47dd1 [2019-12-07 10:17:11,247 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:17:11,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/sv-benchmarks/c/float-newlib/double_req_bl_0621a.c [2019-12-07 10:17:11,252 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/5e0454d33/5ece411040594baab5c1ec055966b035/FLAGa10b47dd1 [2019-12-07 10:17:11,261 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/data/5e0454d33/5ece411040594baab5c1ec055966b035 [2019-12-07 10:17:11,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:17:11,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:17:11,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:17:11,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:17:11,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:17:11,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b30e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11, skipping insertion in model container [2019-12-07 10:17:11,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:17:11,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:17:11,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:17:11,422 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:17:11,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:17:11,504 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:17:11,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11 WrapperNode [2019-12-07 10:17:11,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:17:11,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:17:11,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:17:11,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:17:11,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:17:11,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:17:11,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:17:11,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:17:11,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... [2019-12-07 10:17:11,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:17:11,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:17:11,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:17:11,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:17:11,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:17:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-12-07 10:17:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-12-07 10:17:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:17:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-12-07 10:17:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:17:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:17:11,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:17:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:17:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:17:28,462 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:17:28,462 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 10:17:28,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:28 BoogieIcfgContainer [2019-12-07 10:17:28,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:17:28,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:17:28,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:17:28,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:17:28,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:17:11" (1/3) ... [2019-12-07 10:17:28,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2929f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:17:28, skipping insertion in model container [2019-12-07 10:17:28,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:11" (2/3) ... [2019-12-07 10:17:28,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2929f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:17:28, skipping insertion in model container [2019-12-07 10:17:28,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:28" (3/3) ... [2019-12-07 10:17:28,470 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621a.c [2019-12-07 10:17:28,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:17:28,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:17:28,490 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:17:28,506 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:17:28,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:17:28,506 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:17:28,506 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:17:28,507 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:17:28,507 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:17:28,507 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:17:28,507 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:17:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-12-07 10:17:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:17:28,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:28,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:28,522 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-12-07 10:17:28,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:17:28,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853519435] [2019-12-07 10:17:28,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:17:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:28,825 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 10:17:28,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:17:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:28,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:17:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:28,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853519435] [2019-12-07 10:17:28,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:17:28,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:17:28,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598952051] [2019-12-07 10:17:28,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:17:28,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:17:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:17:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:17:28,859 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-12-07 10:17:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:28,873 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-12-07 10:17:28,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:17:28,874 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 10:17:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:28,882 INFO L225 Difference]: With dead ends: 66 [2019-12-07 10:17:28,883 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 10:17:28,885 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-12-07 10:17:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 10:17:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 10:17:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:17:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-12-07 10:17:28,911 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-12-07 10:17:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:28,911 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-12-07 10:17:28,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:17:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-12-07 10:17:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:17:28,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:28,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:29,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:17:29,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-12-07 10:17:29,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:17:29,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024326290] [2019-12-07 10:17:29,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:17:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:29,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:17:29,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:17:29,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-12-07 10:17:29,717 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:29,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:29,720 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:17:29,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:29,744 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:17:29,745 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:40 [2019-12-07 10:17:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:29,793 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:17:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:29,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-12-07 10:17:29,849 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:29,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:29,851 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:17:29,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:29,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 10:17:29,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2019-12-07 10:17:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:30,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024326290] [2019-12-07 10:17:30,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:17:30,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 10:17:30,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083395525] [2019-12-07 10:17:30,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:17:30,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:17:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:17:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:17:30,054 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 10 states. [2019-12-07 10:17:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:30,376 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-12-07 10:17:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:17:30,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-12-07 10:17:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:30,383 INFO L225 Difference]: With dead ends: 35 [2019-12-07 10:17:30,383 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 10:17:30,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:17:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 10:17:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 10:17:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 10:17:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-12-07 10:17:30,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2019-12-07 10:17:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:30,387 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-12-07 10:17:30,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:17:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-12-07 10:17:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:17:30,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:30,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:30,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:17:30,589 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1317358715, now seen corresponding path program 1 times [2019-12-07 10:17:30,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:17:30,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333994203] [2019-12-07 10:17:30,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9db15683-0cd2-4fd5-9d8d-7897e94786c0/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:17:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:31,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 10:17:31,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:17:31,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:31,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:31,291 INFO L343 Elim1Store]: treesize reduction 57, result has 43.6 percent of original size [2019-12-07 10:17:31,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 99 [2019-12-07 10:17:31,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:31,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:31,294 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:31,618 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-12-07 10:17:31,619 INFO L614 ElimStorePlain]: treesize reduction 83, result has 63.3 percent of original size [2019-12-07 10:17:31,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:17:31,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 10:17:31,623 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:145, output treesize:143 [2019-12-07 10:17:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:17:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:17:31,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:17:31,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:32,081 INFO L237 Elim1Store]: Index analysis took 289 ms [2019-12-07 10:17:32,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:32,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 105 [2019-12-07 10:17:32,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:32,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:32,521 INFO L237 Elim1Store]: Index analysis took 252 ms [2019-12-07 10:17:32,723 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-07 10:17:32,723 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-12-07 10:17:32,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 135 [2019-12-07 10:17:32,725 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:32,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:32,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:32,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 105 [2019-12-07 10:17:32,928 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:32,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:33,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:33,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 103 [2019-12-07 10:17:33,105 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:35,939 WARN L192 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 136 DAG size of output: 122 [2019-12-07 10:17:35,940 INFO L614 ElimStorePlain]: treesize reduction 166, result has 80.9 percent of original size [2019-12-07 10:17:35,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:35,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:35,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:35,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,121 INFO L237 Elim1Store]: Index analysis took 163 ms [2019-12-07 10:17:36,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:36,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:36,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 10:17:36,230 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:36,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,501 INFO L237 Elim1Store]: Index analysis took 244 ms [2019-12-07 10:17:36,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:36,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:36,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 10:17:36,685 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:36,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:36,986 INFO L237 Elim1Store]: Index analysis took 279 ms [2019-12-07 10:17:37,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:37,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:37,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 10:17:37,180 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:37,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:37,269 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:37,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:37,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 10:17:37,276 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:38,772 WARN L192 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 126 DAG size of output: 113 [2019-12-07 10:17:38,773 INFO L614 ElimStorePlain]: treesize reduction 85, result has 88.3 percent of original size [2019-12-07 10:17:38,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:38,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 4 xjuncts. [2019-12-07 10:17:38,776 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:686, output treesize:640 [2019-12-07 10:17:38,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:38,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:38,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:38,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,342 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2019-12-07 10:17:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:17:39,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:39,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:41,219 INFO L237 Elim1Store]: Index analysis took 1388 ms [2019-12-07 10:17:41,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:41,296 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 37 treesize of output 113 [2019-12-07 10:17:41,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:41,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:42,002 INFO L237 Elim1Store]: Index analysis took 673 ms [2019-12-07 10:17:42,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:42,046 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 32 treesize of output 70 [2019-12-07 10:17:42,047 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:42,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:42,543 INFO L237 Elim1Store]: Index analysis took 433 ms [2019-12-07 10:17:42,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:42,579 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 30 treesize of output 68 [2019-12-07 10:17:42,580 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:42,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:42,809 INFO L237 Elim1Store]: Index analysis took 181 ms [2019-12-07 10:17:42,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:42,853 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 32 treesize of output 70 [2019-12-07 10:17:42,854 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:46,032 WARN L192 SmtUtils]: Spent 3.18 s on a formula simplification that was a NOOP. DAG size: 288 [2019-12-07 10:17:46,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:46,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:46,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:46,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:46,761 INFO L237 Elim1Store]: Index analysis took 687 ms [2019-12-07 10:17:47,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:47,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:47,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:47,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:47,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 10:17:47,202 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:47,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:47,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:47,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:47,780 INFO L237 Elim1Store]: Index analysis took 552 ms [2019-12-07 10:17:48,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,075 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:48,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:48,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 10:17:48,116 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:48,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,487 INFO L237 Elim1Store]: Index analysis took 347 ms [2019-12-07 10:17:48,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:48,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:48,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 10:17:48,707 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:48,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:17:48,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:17:48,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:17:48,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 10:17:48,886 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 10:17:51,675 WARN L192 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 328 DAG size of output: 294 [2019-12-07 10:17:51,676 INFO L614 ElimStorePlain]: treesize reduction 160, result has 82.0 percent of original size [2019-12-07 10:17:51,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 30 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 35 dim-0 vars, and 4 xjuncts. [2019-12-07 10:17:51,690 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 32 variables, input treesize:762, output treesize:727 [2019-12-07 10:17:51,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:51,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:54,494 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 118 [2019-12-07 10:17:54,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:54,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:56,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:56,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:59,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:17:59,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:18:00,117 INFO L237 Elim1Store]: Index analysis took 706 ms [2019-12-07 10:18:00,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:18:00,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 13 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 7 case distinctions, treesize of input 165 treesize of output 91 [2019-12-07 10:18:00,143 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:18:00,250 INFO L343 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2019-12-07 10:18:00,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 67 [2019-12-07 10:18:00,251 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:18:04,411 WARN L192 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-07 10:18:04,411 INFO L614 ElimStorePlain]: treesize reduction 159, result has 41.8 percent of original size [2019-12-07 10:18:04,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:18:04,415 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:467, output treesize:67 [2019-12-07 10:18:05,162 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 10:18:06,380 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 10:18:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:06,456 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:18:09,543 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 10:18:11,618 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 10:18:20,249 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 10:18:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:20,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333994203] [2019-12-07 10:18:20,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:20,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 10:18:20,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813735310] [2019-12-07 10:18:20,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:18:20,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:18:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:18:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=95, Unknown=5, NotChecked=0, Total=132 [2019-12-07 10:18:20,254 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 12 states. [2019-12-07 10:18:35,616 WARN L192 SmtUtils]: Spent 5.64 s on a formula simplification. DAG size of input: 337 DAG size of output: 336 [2019-12-07 10:18:47,292 WARN L192 SmtUtils]: Spent 11.08 s on a formula simplification. DAG size of input: 341 DAG size of output: 340 [2019-12-07 10:18:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:47,295 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-12-07 10:18:47,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:18:47,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 10:18:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:47,295 INFO L225 Difference]: With dead ends: 14 [2019-12-07 10:18:47,295 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:18:47,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=55, Invalid=122, Unknown=5, NotChecked=0, Total=182 [2019-12-07 10:18:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:18:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:18:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:18:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:18:47,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-12-07 10:18:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:47,297 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:18:47,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:18:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:18:47,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:18:47,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:18:47,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:18:50,428 WARN L192 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 366 [2019-12-07 10:18:51,097 WARN L192 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 340 [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L242 CegarLoopResult]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L144(lines 144 147) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L242 CegarLoopResult]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-12-07 10:18:51,199 INFO L246 CegarLoopResult]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-12-07 10:18:51,200 INFO L242 CegarLoopResult]: At program point L130-3(lines 64 132) 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))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (v_arrayElimCell_102 (_ BitVec 32)) (v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= (fp.add roundNearestTiesToEven (let ((.cse0 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_3) ((_ extract 31 0) v_skolemized_v_prenex_1_3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_12_3) v_arrayElimCell_102))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) |ULTIMATE.start_atan_double_#res|) (= (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 (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_atan_double_~x)) (let ((.cse9 (select |#valid| (_ bv0 32))) (.cse2 (= |~#atanhi_atan~0.offset| (_ bv0 32))) (.cse4 (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (.cse12 (= |~#atanlo_atan~0.base| (_ bv0 32))) (.cse7 (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|))) (.cse8 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse2 (exists ((v_prenex_24 (_ BitVec 64))) (let ((.cse3 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (select .cse3 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_24)) (= (select .cse3 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_24)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24)))))) .cse4 (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_23 (_ BitVec 64))) (let ((.cse5 (= |~#atanlo_atan~0.base| v_prenex_26)) (.cse6 (select |#memory_int| v_prenex_26))) (and (not .cse5) (or .cse5 (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|))) (= (select .cse6 (_ bv4 32)) ((_ extract 63 32) v_prenex_23)) (= (_ bv0 1) (select |#valid| v_prenex_26)) (= (select .cse6 (_ bv0 32)) ((_ extract 31 0) v_prenex_23))))) .cse7 (exists ((v_prenex_28 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_28)) (= (fp ((_ extract 63 63) v_prenex_28) ((_ extract 62 52) v_prenex_28) ((_ extract 51 0) v_prenex_28)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) (exists ((v_prenex_27 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32))) ((_ extract 31 0) v_prenex_27)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0)) (fp ((_ extract 63 63) v_prenex_27) ((_ extract 62 52) v_prenex_27) ((_ extract 51 0) v_prenex_27))))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_29 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_29) ((_ extract 62 52) v_prenex_29) ((_ extract 51 0) v_prenex_29))) (= (select (select |#memory_int| v_prenex_25) (_ bv8 32)) ((_ extract 31 0) v_prenex_29)) (= (_ bv1 1) (select |#valid| v_prenex_25)) (not (= |~#atanlo_atan~0.base| v_prenex_25)))) .cse8 (= (_ bv0 32) |~#atanhi_atan~0.base|)) (and (= (_ bv1 1) .cse9) .cse2 (exists ((v_prenex_30 (_ BitVec 64)) (v_prenex_32 (_ BitVec 32))) (let ((.cse10 (select |#memory_int| v_prenex_32)) (.cse11 (= |~#atanlo_atan~0.base| v_prenex_32))) (and (= ((_ extract 63 32) v_prenex_30) (select .cse10 (_ bv4 32))) (= (_ bv0 1) (select |#valid| v_prenex_32)) (= ((_ extract 31 0) v_prenex_30) (select .cse10 (_ bv0 32))) (not .cse11) (or .cse11 (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|)))))) .cse4 (exists ((v_prenex_35 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_35) ((_ extract 62 52) v_prenex_35) ((_ extract 51 0) v_prenex_35))) (= (select (select |#memory_int| (_ bv0 32)) (_ bv8 32)) ((_ extract 31 0) v_prenex_35)))) .cse7 (exists ((v_prenex_33 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_33) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (not .cse12) .cse8 (exists ((v_prenex_31 (_ BitVec 64))) (let ((.cse13 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_31) (select .cse13 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_31) (select .cse13 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_31) ((_ extract 62 52) v_prenex_31) ((_ extract 51 0) v_prenex_31)))))) (exists ((v_prenex_34 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_34) ((_ extract 62 52) v_prenex_34) ((_ extract 51 0) v_prenex_34)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_34) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))))))) (and .cse2 (exists ((v_prenex_38 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32))) ((_ extract 31 0) v_prenex_38)) (= (fp ((_ extract 63 63) v_prenex_38) ((_ extract 62 52) v_prenex_38) ((_ extract 51 0) v_prenex_38)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))))) .cse4 (= (_ bv0 1) .cse9) .cse7 (exists ((v_prenex_40 (_ BitVec 32)) (v_prenex_36 (_ BitVec 64))) (let ((.cse14 (= |~#atanlo_atan~0.base| v_prenex_40)) (.cse15 (select |#memory_int| v_prenex_40))) (and (not .cse14) (= (select .cse15 (_ bv4 32)) ((_ extract 63 32) v_prenex_36)) (or (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|)) .cse14) (= ((_ extract 31 0) v_prenex_36) (select .cse15 (_ bv0 32))) (= (select |#valid| v_prenex_40) (_ bv0 1))))) (exists ((v_prenex_37 (_ BitVec 64))) (let ((.cse16 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_37) ((_ extract 62 52) v_prenex_37) ((_ extract 51 0) v_prenex_37))) (= (select .cse16 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_37)) (= (select .cse16 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_37))))) (exists ((v_prenex_41 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_41) ((_ extract 62 52) v_prenex_41) ((_ extract 51 0) v_prenex_41)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_41) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))))) (exists ((v_prenex_39 (_ BitVec 32)) (v_prenex_42 (_ BitVec 64))) (and (not (= |~#atanlo_atan~0.base| v_prenex_39)) (= ((_ extract 31 0) v_prenex_42) (select (select |#memory_int| v_prenex_39) (_ bv8 32))) (= (_ bv1 1) (select |#valid| v_prenex_39)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))))) .cse8) (and (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 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))))) .cse2 (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_14_3 (_ BitVec 64))) (and (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (= (_ bv1 1) (select |#valid| |~#aT_atan~0.base|)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))))) .cse4 .cse12 .cse7 (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32))) (let ((.cse17 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse18 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse17) (or .cse17 (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|))) (= (select .cse18 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|)) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (select .cse18 (_ bv4 32)))))) (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) .cse8 (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (let ((.cse19 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ((_ extract 31 0) v_skolemized_v_prenex_1_3) (select .cse19 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) (select .cse19 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))))))))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64)) (v_skolemized_v_prenex_20_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse20 (fp ((_ extract 63 63) v_skolemized_v_prenex_20_3) ((_ extract 62 52) v_skolemized_v_prenex_20_3) ((_ extract 51 0) v_skolemized_v_prenex_20_3)))) (and (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) .cse20) (= (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)) .cse20) (= ((_ extract 31 0) v_skolemized_v_prenex_20_3) ULTIMATE.start_atan_double_~low~0) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0))))) [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L249 CegarLoopResult]: At program point L148(lines 134 149) the Hoare annotation is: true [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-12-07 10:18:51,201 INFO L246 CegarLoopResult]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-12-07 10:18:51,202 INFO L242 CegarLoopResult]: 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 ((.cse5 (select |#valid| (_ bv0 32))) (.cse2 (= |~#atanhi_atan~0.offset| (_ bv0 32))) (.cse3 (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (.cse14 (= |~#atanlo_atan~0.base| (_ bv0 32))) (.cse6 (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|))) (.cse7 (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0)) (.cse8 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((v_prenex_40 (_ BitVec 32)) (v_prenex_36 (_ BitVec 64))) (let ((.cse0 (= v_prenex_40 |~#atanlo_atan~0.base|)) (.cse1 (select |#memory_int| v_prenex_40))) (and (not .cse0) (= ((_ extract 63 32) v_prenex_36) (select .cse1 (_ bv4 32))) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse0) (= (select |#valid| v_prenex_40) (_ bv0 1)) (= (select .cse1 (_ bv0 32)) ((_ extract 31 0) v_prenex_36))))) .cse2 .cse3 (exists ((v_prenex_37 (_ BitVec 64))) (let ((.cse4 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_37) ((_ extract 62 52) v_prenex_37) ((_ extract 51 0) v_prenex_37))) (= ((_ extract 31 0) v_prenex_37) (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_37) (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))))))) (= (_ bv0 1) .cse5) (exists ((v_prenex_38 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_38) ((_ extract 62 52) v_prenex_38) ((_ extract 51 0) v_prenex_38)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_38) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) .cse6 (exists ((v_prenex_39 (_ BitVec 32)) (v_prenex_42 (_ BitVec 64))) (and (not (= v_prenex_39 |~#atanlo_atan~0.base|)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))) (= (select (select |#memory_int| v_prenex_39) (_ bv8 32)) ((_ extract 31 0) v_prenex_42)) (= (bvadd (select |#valid| v_prenex_39) (_ bv1 1)) (_ bv0 1)))) (exists ((v_prenex_41 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_41) ((_ extract 62 52) v_prenex_41) ((_ extract 51 0) v_prenex_41)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_41) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))))) .cse7 .cse8) (and (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_29 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_29) ((_ extract 62 52) v_prenex_29) ((_ extract 51 0) v_prenex_29))) (= (select (select |#memory_int| v_prenex_25) (_ bv8 32)) ((_ extract 31 0) v_prenex_29)) (= (bvadd (select |#valid| v_prenex_25) (_ bv1 1)) (_ bv0 1)) (not (= v_prenex_25 |~#atanlo_atan~0.base|)))) .cse2 (exists ((v_prenex_27 (_ BitVec 64))) (and (= ((_ extract 31 0) v_prenex_27) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0)) (fp ((_ extract 63 63) v_prenex_27) ((_ extract 62 52) v_prenex_27) ((_ extract 51 0) v_prenex_27))))) (exists ((v_prenex_24 (_ BitVec 64))) (let ((.cse9 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_prenex_24) (select .cse9 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_prenex_24) (select .cse9 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24)))))) .cse3 (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_23 (_ BitVec 64))) (let ((.cse10 (= v_prenex_26 |~#atanlo_atan~0.base|)) (.cse11 (select |#memory_int| v_prenex_26))) (and (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse10) (= ((_ extract 63 32) v_prenex_23) (select .cse11 (_ bv4 32))) (not .cse10) (= (select |#valid| v_prenex_26) (_ bv0 1)) (= (select .cse11 (_ bv0 32)) ((_ extract 31 0) v_prenex_23))))) .cse6 (exists ((v_prenex_28 (_ BitVec 64))) (and (= ((_ extract 63 32) v_prenex_28) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= (fp ((_ extract 63 63) v_prenex_28) ((_ extract 62 52) v_prenex_28) ((_ extract 51 0) v_prenex_28)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) .cse7 .cse8 (= (_ bv0 32) |~#atanhi_atan~0.base|)) (and (= (_ bv1 1) .cse5) .cse2 (exists ((v_prenex_30 (_ BitVec 64)) (v_prenex_32 (_ BitVec 32))) (let ((.cse12 (= v_prenex_32 |~#atanlo_atan~0.base|)) (.cse13 (select |#memory_int| v_prenex_32))) (and (not .cse12) (= (select |#valid| v_prenex_32) (_ bv0 1)) (= (select .cse13 (_ bv0 32)) ((_ extract 31 0) v_prenex_30)) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse12) (= ((_ extract 63 32) v_prenex_30) (select .cse13 (_ bv4 32)))))) .cse3 (exists ((v_prenex_35 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_35) ((_ extract 62 52) v_prenex_35) ((_ extract 51 0) v_prenex_35))) (= (select (select |#memory_int| (_ bv0 32)) (_ bv8 32)) ((_ extract 31 0) v_prenex_35)))) .cse6 (exists ((v_prenex_33 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_33) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (not .cse14) .cse7 .cse8 (exists ((v_prenex_31 (_ BitVec 64))) (let ((.cse15 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_31) (select .cse15 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_31) (select .cse15 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_31) ((_ extract 62 52) v_prenex_31) ((_ extract 51 0) v_prenex_31)))))) (exists ((v_prenex_34 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_34) ((_ extract 62 52) v_prenex_34) ((_ extract 51 0) v_prenex_34)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_34) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))))))) (and (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 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))))) (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_14_3 (_ BitVec 64))) (and (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) .cse2 .cse3 .cse14 .cse6 (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) .cse7 .cse8 (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32))) (let ((.cse16 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse17 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse16) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse16) (= (select .cse17 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|)) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (select .cse17 (_ bv4 32)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (let ((.cse18 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ((_ extract 31 0) v_skolemized_v_prenex_1_3) (select .cse18 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) (select .cse18 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_atan_double_~x)) (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-12-07 10:18:51,202 INFO L246 CegarLoopResult]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-12-07 10:18:51,202 INFO L246 CegarLoopResult]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-12-07 10:18:51,203 INFO L242 CegarLoopResult]: At program point L68-2(lines 68 72) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 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))))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_atan_double_~x)) (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_14_3 (_ BitVec 64))) (and (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (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))) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ((_ extract 31 0) v_skolemized_v_prenex_1_3) (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))))))) [2019-12-07 10:18:51,206 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:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 10:18:51,208 INFO L168 Benchmark]: Toolchain (without parser) took 99944.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.5 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:51,209 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:18:51,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:51,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:18:51,209 INFO L168 Benchmark]: Boogie Preprocessor took 29.14 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:51,210 INFO L168 Benchmark]: RCFGBuilder took 16893.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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:51,210 INFO L168 Benchmark]: TraceAbstraction took 82743.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -70.1 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:51,212 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.02 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 29.14 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16893.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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82743.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -70.1 MB). Peak memory consumption was 55.2 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...