./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ...................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 16:49:55,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:49:55,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:49:55,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:49:55,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:49:55,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:49:55,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:49:55,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:49:55,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:49:55,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:49:55,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:49:55,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:49:55,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:49:55,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:49:55,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:49:55,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:49:55,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:49:55,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:49:55,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:49:55,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:49:55,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:49:55,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:49:55,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:49:55,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:49:55,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:49:55,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:49:55,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:49:55,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:49:55,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:49:55,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:49:55,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:49:55,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:49:55,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:49:55,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:49:55,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:49:55,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:49:55,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:49:55,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:49:55,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:49:55,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:49:55,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:49:55,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:49:55,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:49:55,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:49:55,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:49:55,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:49:55,985 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:49:55,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:49:55,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:49:55,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:49:55,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:49:55,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:49:55,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:49:55,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:49:55,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:49:55,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:49:55,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:49:55,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:49:55,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:49:55,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:49:55,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:49:55,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:49:55,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:49:55,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:55,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:49:55,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:49:55,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:49:55,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:49:55,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:49:55,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:49:55,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:49:55,993 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2019-11-28 16:49:56,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:49:56,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:49:56,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:49:56,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:49:56,321 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:49:56,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-28 16:49:56,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7aa687a/20a7cc5fcdeb486ca9f4902d8be02226/FLAGcc602f8e8 [2019-11-28 16:49:56,940 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:49:56,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-28 16:49:56,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7aa687a/20a7cc5fcdeb486ca9f4902d8be02226/FLAGcc602f8e8 [2019-11-28 16:49:57,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7aa687a/20a7cc5fcdeb486ca9f4902d8be02226 [2019-11-28 16:49:57,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:49:57,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:49:57,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:57,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:49:57,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:49:57,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d98bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57, skipping insertion in model container [2019-11-28 16:49:57,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:49:57,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:49:57,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:57,642 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:49:57,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:57,701 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:49:57,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57 WrapperNode [2019-11-28 16:49:57,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:57,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:57,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:49:57,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:49:57,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:57,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:49:57,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:49:57,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:49:57,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... [2019-11-28 16:49:57,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:49:57,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:49:57,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:49:57,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:49:57,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:49:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-28 16:49:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:49:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-28 16:49:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:49:57,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:49:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-28 16:49:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:49:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:49:58,472 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:49:58,473 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 16:49:58,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:58 BoogieIcfgContainer [2019-11-28 16:49:58,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:49:58,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:49:58,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:49:58,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:49:58,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:49:57" (1/3) ... [2019-11-28 16:49:58,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e65a87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:58, skipping insertion in model container [2019-11-28 16:49:58,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:57" (2/3) ... [2019-11-28 16:49:58,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e65a87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:58, skipping insertion in model container [2019-11-28 16:49:58,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:58" (3/3) ... [2019-11-28 16:49:58,488 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-11-28 16:49:58,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:49:58,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:49:58,521 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:49:58,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:49:58,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:49:58,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:49:58,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:49:58,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:49:58,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:49:58,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:49:58,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:49:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-28 16:49:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:49:58,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:58,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:58,570 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-28 16:49:58,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:58,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398496453] [2019-11-28 16:49:58,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:49:58,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398496453] [2019-11-28 16:49:58,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:58,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:49:58,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009491974] [2019-11-28 16:49:58,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:49:58,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:49:58,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:49:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:58,747 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-28 16:49:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:58,774 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-28 16:49:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:49:58,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-28 16:49:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:58,788 INFO L225 Difference]: With dead ends: 102 [2019-11-28 16:49:58,788 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:49:58,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:49:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 16:49:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 16:49:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-28 16:49:58,839 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-28 16:49:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:58,840 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-28 16:49:58,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:49:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-28 16:49:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:49:58,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:58,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:58,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-28 16:49:58,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:58,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87640694] [2019-11-28 16:49:58,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:49:59,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87640694] [2019-11-28 16:49:59,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:59,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:49:59,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213317380] [2019-11-28 16:49:59,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:49:59,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:49:59,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:49:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:49:59,035 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2019-11-28 16:49:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:59,065 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 16:49:59,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:49:59,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 16:49:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:59,067 INFO L225 Difference]: With dead ends: 52 [2019-11-28 16:49:59,067 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:49:59,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:49:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:49:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 16:49:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 16:49:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-28 16:49:59,075 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2019-11-28 16:49:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:59,076 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-28 16:49:59,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:49:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-28 16:49:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:49:59,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:59,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:59,078 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2019-11-28 16:49:59,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:59,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628281572] [2019-11-28 16:49:59,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:49:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:49:59,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:49:59,361 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:49:59,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:49:59 BoogieIcfgContainer [2019-11-28 16:49:59,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:49:59,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:49:59,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:49:59,434 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:49:59,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:58" (3/4) ... [2019-11-28 16:49:59,440 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 16:49:59,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:49:59,443 INFO L168 Benchmark]: Toolchain (without parser) took 2171.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -73.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:59,445 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:49:59,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:59,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:49:59,449 INFO L168 Benchmark]: Boogie Preprocessor took 48.36 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:59,450 INFO L168 Benchmark]: RCFGBuilder took 661.59 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:59,452 INFO L168 Benchmark]: TraceAbstraction took 954.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:59,453 INFO L168 Benchmark]: Witness Printer took 9.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:49:59,469 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.93 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.13 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 48.36 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 661.59 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 954.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Witness Printer took 9.67 ms. Allocated memory is still 1.2 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: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [one_modf=1] [L144] double x = -1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [one_modf=1] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [one_modf=1] [L30] COND TRUE j0 < 20 VAL [one_modf=1] [L31] COND TRUE j0 < 0 VAL [one_modf=1] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [one_modf=1] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) [L112] __int32_t hx, lx; VAL [one_modf=1] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 0 SDslu, 49 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-11-28 16:50:01,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:50:01,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:50:01,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:50:01,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:50:01,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:50:01,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:50:01,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:50:01,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:50:01,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:50:01,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:50:01,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:50:01,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:50:01,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:50:01,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:50:01,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:50:01,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:50:01,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:50:01,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:50:01,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:50:01,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:50:01,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:50:01,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:50:01,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:50:01,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:50:01,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:50:01,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:50:01,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:50:01,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:50:01,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:50:01,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:50:01,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:50:01,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:50:01,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:50:01,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:50:01,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:50:01,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:50:01,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:50:01,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:50:01,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:50:01,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:50:01,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 16:50:01,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:50:01,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:50:01,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:50:01,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:50:01,626 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:50:01,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:50:01,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:50:01,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:50:01,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:50:01,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:50:01,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:50:01,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:50:01,629 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 16:50:01,630 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 16:50:01,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:50:01,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:50:01,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:50:01,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:50:01,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:50:01,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:50:01,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:50:01,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:50:01,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:50:01,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:50:01,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:50:01,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:50:01,634 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 16:50:01,634 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 16:50:01,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:50:01,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:50:01,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 16:50:01,635 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2019-11-28 16:50:01,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:50:01,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:50:01,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:50:01,969 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:50:01,970 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:50:01,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-28 16:50:02,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ec77d90/e7361d7ecc8543e6bb2bc8673615d683/FLAGd479dee46 [2019-11-28 16:50:02,538 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:50:02,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-28 16:50:02,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ec77d90/e7361d7ecc8543e6bb2bc8673615d683/FLAGd479dee46 [2019-11-28 16:50:02,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ec77d90/e7361d7ecc8543e6bb2bc8673615d683 [2019-11-28 16:50:02,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:50:02,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:50:02,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:02,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:50:02,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:50:02,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:02" (1/1) ... [2019-11-28 16:50:02,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc5c18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:02, skipping insertion in model container [2019-11-28 16:50:02,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:02" (1/1) ... [2019-11-28 16:50:02,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:50:02,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:50:03,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:03,261 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:50:03,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:03,410 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:50:03,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03 WrapperNode [2019-11-28 16:50:03,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:03,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:03,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:50:03,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:50:03,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:03,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:50:03,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:50:03,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:50:03,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:50:03,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:50:03,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:50:03,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:50:03,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:50:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-28 16:50:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-28 16:50:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:50:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-28 16:50:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 16:50:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:50:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:50:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 16:50:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:50:04,949 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:50:04,950 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 16:50:04,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:04 BoogieIcfgContainer [2019-11-28 16:50:04,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:50:04,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:50:04,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:50:04,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:50:04,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:50:02" (1/3) ... [2019-11-28 16:50:04,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ebf2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:04, skipping insertion in model container [2019-11-28 16:50:04,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03" (2/3) ... [2019-11-28 16:50:04,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ebf2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:04, skipping insertion in model container [2019-11-28 16:50:04,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:04" (3/3) ... [2019-11-28 16:50:04,960 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-11-28 16:50:04,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:50:04,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:50:04,990 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:50:05,011 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:50:05,011 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:50:05,012 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:50:05,012 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:50:05,012 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:50:05,012 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:50:05,012 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:50:05,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:50:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-28 16:50:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:50:05,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:05,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:05,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-28 16:50:05,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:05,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23117195] [2019-11-28 16:50:05,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:05,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 16:50:05,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,228 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23117195] [2019-11-28 16:50:05,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:05,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 16:50:05,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041822530] [2019-11-28 16:50:05,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:50:05,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:50:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:05,269 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-28 16:50:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:05,311 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-28 16:50:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:50:05,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-28 16:50:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:05,329 INFO L225 Difference]: With dead ends: 102 [2019-11-28 16:50:05,329 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:50:05,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:50:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 16:50:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 16:50:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-28 16:50:05,377 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-28 16:50:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:05,377 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-28 16:50:05,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:50:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-28 16:50:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:50:05,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:05,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:05,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,583 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-28 16:50:05,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:05,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922228334] [2019-11-28 16:50:05,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:05,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:50:05,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,936 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922228334] [2019-11-28 16:50:06,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:06,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-28 16:50:06,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012658039] [2019-11-28 16:50:06,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:50:06,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:06,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:50:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:50:06,105 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-11-28 16:50:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:06,842 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-28 16:50:06,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:06,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 16:50:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:06,847 INFO L225 Difference]: With dead ends: 64 [2019-11-28 16:50:06,847 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:06,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:50:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 16:50:06,857 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-11-28 16:50:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:06,857 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 16:50:06,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:50:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 16:50:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:50:06,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:06,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:07,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-11-28 16:50:07,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:07,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662288926] [2019-11-28 16:50:07,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:07,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 16:50:07,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:07,460 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:07,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662288926] [2019-11-28 16:50:07,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:07,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 16:50:07,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727859495] [2019-11-28 16:50:07,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:50:07,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:07,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:50:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:50:07,467 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-11-28 16:50:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:07,496 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-28 16:50:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:50:07,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 16:50:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:07,498 INFO L225 Difference]: With dead ends: 30 [2019-11-28 16:50:07,499 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:07,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:50:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-28 16:50:07,506 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-11-28 16:50:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:07,507 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-28 16:50:07,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:50:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-28 16:50:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:50:07,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:07,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:07,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-11-28 16:50:07,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:07,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102886290] [2019-11-28 16:50:07,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:08,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 16:50:08,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:08,367 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 51 treesize of output 45 [2019-11-28 16:50:08,373 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:50:08,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:08,379 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:50:08,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:08,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:50:08,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-28 16:50:08,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:08,466 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:08,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102886290] [2019-11-28 16:50:08,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:08,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-28 16:50:08,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10382739] [2019-11-28 16:50:08,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:50:08,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:50:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:50:08,555 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-11-28 16:50:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:09,683 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-11-28 16:50:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:09,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 16:50:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:09,687 INFO L225 Difference]: With dead ends: 31 [2019-11-28 16:50:09,687 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:09,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:50:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-28 16:50:09,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-11-28 16:50:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:09,699 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-28 16:50:09,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:50:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-28 16:50:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:50:09,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:09,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:09,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 16:50:09,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-11-28 16:50:09,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:09,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001143636] [2019-11-28 16:50:09,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:10,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 16:50:10,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:10,381 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 54 treesize of output 48 [2019-11-28 16:50:10,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:50:10,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:10,401 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:50:10,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:10,436 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:50:10,436 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:40 [2019-11-28 16:50:10,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:11,023 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:11,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:11,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:11,688 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 58 treesize of output 52 [2019-11-28 16:50:11,695 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:50:11,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:11,699 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:50:11,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:11,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:50:11,710 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:36 [2019-11-28 16:50:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:12,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001143636] [2019-11-28 16:50:12,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:12,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-11-28 16:50:12,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125526284] [2019-11-28 16:50:12,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 16:50:12,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 16:50:12,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:50:12,029 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-11-28 16:50:14,410 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 16:50:14,723 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-28 16:50:15,085 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 16:50:15,389 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 16:50:15,743 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-28 16:50:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:15,745 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-28 16:50:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:50:15,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-28 16:50:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:15,746 INFO L225 Difference]: With dead ends: 27 [2019-11-28 16:50:15,746 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:50:15,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-28 16:50:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:50:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:50:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:50:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:50:15,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-28 16:50:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:15,749 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:50:15,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 16:50:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:50:15,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:50:15,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 16:50:15,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:50:16,525 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-28 16:50:16,904 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-28 16:50:17,456 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-28 16:50:17,963 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-28 16:50:18,221 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-11-28 16:50:18,304 INFO L246 CegarLoopResult]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-11-28 16:50:18,305 INFO L242 CegarLoopResult]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-11-28 16:50:18,305 INFO L246 CegarLoopResult]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-28 16:50:18,305 INFO L242 CegarLoopResult]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))))))) [2019-11-28 16:50:18,305 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:50:18,305 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:50:18,305 INFO L246 CegarLoopResult]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-11-28 16:50:18,305 INFO L242 CegarLoopResult]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-11-28 16:50:18,306 INFO L246 CegarLoopResult]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-28 16:50:18,306 INFO L242 CegarLoopResult]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))) (= ULTIMATE.start___signbit_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_main_~res~0 (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) |ULTIMATE.start_main_#t~short32| (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~x (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))))) [2019-11-28 16:50:18,306 INFO L246 CegarLoopResult]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-28 16:50:18,307 INFO L246 CegarLoopResult]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-11-28 16:50:18,307 INFO L249 CegarLoopResult]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-11-28 16:50:18,307 INFO L246 CegarLoopResult]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-11-28 16:50:18,307 INFO L242 CegarLoopResult]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) |ULTIMATE.start_modf_double_#res|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~x (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))))) [2019-11-28 16:50:18,307 INFO L246 CegarLoopResult]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-11-28 16:50:18,308 INFO L242 CegarLoopResult]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) |ULTIMATE.start_modf_double_#res|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~x (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))))) [2019-11-28 16:50:18,308 INFO L246 CegarLoopResult]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-11-28 16:50:18,308 INFO L242 CegarLoopResult]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) |ULTIMATE.start_modf_double_#res|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~x (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))))) [2019-11-28 16:50:18,308 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-11-28 16:50:18,309 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 28) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) [2019-11-28 16:50:18,309 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-11-28 16:50:18,309 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:50:18,310 INFO L246 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-11-28 16:50:18,310 INFO L242 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-11-28 16:50:18,310 INFO L246 CegarLoopResult]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-11-28 16:50:18,310 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-28 16:50:18,310 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-28 16:50:18,311 INFO L242 CegarLoopResult]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-11-28 16:50:18,311 INFO L246 CegarLoopResult]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-11-28 16:50:18,311 INFO L246 CegarLoopResult]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-11-28 16:50:18,311 INFO L246 CegarLoopResult]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-11-28 16:50:18,311 INFO L246 CegarLoopResult]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-11-28 16:50:18,312 INFO L246 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-28 16:50:18,312 INFO L246 CegarLoopResult]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-11-28 16:50:18,312 INFO L246 CegarLoopResult]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-11-28 16:50:18,312 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-11-28 16:50:18,312 INFO L246 CegarLoopResult]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-11-28 16:50:18,313 INFO L246 CegarLoopResult]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-11-28 16:50:18,313 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-11-28 16:50:18,313 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:50:18,313 INFO L246 CegarLoopResult]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-11-28 16:50:18,313 INFO L246 CegarLoopResult]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-11-28 16:50:18,314 INFO L246 CegarLoopResult]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-11-28 16:50:18,314 INFO L246 CegarLoopResult]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-11-28 16:50:18,314 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-28 16:50:18,314 INFO L246 CegarLoopResult]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-11-28 16:50:18,314 INFO L246 CegarLoopResult]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-11-28 16:50:18,315 INFO L246 CegarLoopResult]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-11-28 16:50:18,315 INFO L246 CegarLoopResult]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-11-28 16:50:18,315 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-28 16:50:18,316 INFO L242 CegarLoopResult]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))) (= ULTIMATE.start___signbit_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_main_~res~0 (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_skolemized_v_prenex_6_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) |ULTIMATE.start_main_#t~short32| (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~x (let ((.cse4 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))))) [2019-11-28 16:50:18,323 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: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-11-28 16:50:18,329 INFO L168 Benchmark]: Toolchain (without parser) took 15474.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:18,330 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:18,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:18,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:18,332 INFO L168 Benchmark]: Boogie Preprocessor took 56.86 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:18,333 INFO L168 Benchmark]: RCFGBuilder took 1420.24 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: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:18,333 INFO L168 Benchmark]: TraceAbstraction took 13374.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -37.0 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:18,337 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.86 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1420.24 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: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13374.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -37.0 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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. Received shutdown request...