./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1032b.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_1032b.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 2fc40f01120ca51e77cbf79a7824b0aac7011828 .................................................................................................................................................................................................................................................................................. 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_1032b.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 2fc40f01120ca51e77cbf79a7824b0aac7011828 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:13,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:49:13,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:49:13,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:49:13,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:49:13,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:49:13,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:49:13,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:49:13,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:49:13,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:49:13,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:49:13,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:49:13,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:49:14,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:49:14,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:49:14,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:49:14,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:49:14,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:49:14,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:49:14,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:49:14,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:49:14,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:49:14,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:49:14,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:49:14,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:49:14,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:49:14,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:49:14,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:49:14,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:49:14,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:49:14,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:49:14,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:49:14,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:49:14,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:49:14,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:49:14,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:49:14,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:49:14,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:49:14,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:49:14,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:49:14,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:49:14,050 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:14,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:49:14,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:49:14,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:49:14,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:49:14,097 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:49:14,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:49:14,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:49:14,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:49:14,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:49:14,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:49:14,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:49:14,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:49:14,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:49:14,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:49:14,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:49:14,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:49:14,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:49:14,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:49:14,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:49:14,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:49:14,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:49:14,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:14,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:49:14,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:49:14,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:49:14,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:49:14,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:49:14,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:49:14,109 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:49:14,109 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 -> 2fc40f01120ca51e77cbf79a7824b0aac7011828 [2019-11-28 16:49:14,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:49:14,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:49:14,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:49:14,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:49:14,500 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:49:14,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1032b.c [2019-11-28 16:49:14,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d0bc016/1bcaad1e5e614e968e295313a69129f7/FLAGbe76f54b0 [2019-11-28 16:49:15,066 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:49:15,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032b.c [2019-11-28 16:49:15,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d0bc016/1bcaad1e5e614e968e295313a69129f7/FLAGbe76f54b0 [2019-11-28 16:49:15,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d0bc016/1bcaad1e5e614e968e295313a69129f7 [2019-11-28 16:49:15,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:49:15,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:49:15,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:15,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:49:15,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:49:15,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:15" (1/1) ... [2019-11-28 16:49:15,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603018b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:15, skipping insertion in model container [2019-11-28 16:49:15,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:15" (1/1) ... [2019-11-28 16:49:15,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:49:15,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:49:15,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:15,761 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:49:15,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:15,880 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:49:15,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:15 WrapperNode [2019-11-28 16:49:15,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:15,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:15,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:49:15,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:49:15,891 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:15" (1/1) ... [2019-11-28 16:49:15,903 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:15" (1/1) ... [2019-11-28 16:49:15,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:15,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:49:15,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:49:15,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:49:15,946 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:15" (1/1) ... [2019-11-28 16:49:15,946 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:15" (1/1) ... [2019-11-28 16:49:15,949 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:15" (1/1) ... [2019-11-28 16:49:15,950 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:15" (1/1) ... [2019-11-28 16:49:15,960 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:15" (1/1) ... [2019-11-28 16:49:15,966 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:15" (1/1) ... [2019-11-28 16:49:15,968 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:15" (1/1) ... [2019-11-28 16:49:15,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:49:15,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:49:15,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:49:15,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:49:15,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:15" (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:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:49:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-28 16:49:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:49:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-28 16:49:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:49:16,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:49:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:49:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:49:16,452 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:49:16,452 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 16:49:16,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:16 BoogieIcfgContainer [2019-11-28 16:49:16,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:49:16,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:49:16,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:49:16,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:49:16,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:49:15" (1/3) ... [2019-11-28 16:49:16,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37976acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:16, skipping insertion in model container [2019-11-28 16:49:16,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:15" (2/3) ... [2019-11-28 16:49:16,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37976acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:16, skipping insertion in model container [2019-11-28 16:49:16,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:16" (3/3) ... [2019-11-28 16:49:16,463 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032b.c [2019-11-28 16:49:16,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:49:16,481 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:49:16,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:49:16,515 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:49:16,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:49:16,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:49:16,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:49:16,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:49:16,517 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:49:16,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:49:16,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:49:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-28 16:49:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:49:16,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:16,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:16,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2068179301, now seen corresponding path program 1 times [2019-11-28 16:49:16,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:16,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55931687] [2019-11-28 16:49:16,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:16,656 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:16,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55931687] [2019-11-28 16:49:16,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:16,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:49:16,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489216596] [2019-11-28 16:49:16,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:49:16,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:49:16,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:49:16,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:16,678 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-28 16:49:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:16,695 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2019-11-28 16:49:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:49:16,697 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-28 16:49:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:16,707 INFO L225 Difference]: With dead ends: 58 [2019-11-28 16:49:16,707 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:49:16,710 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:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:49:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:49:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:49:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-28 16:49:16,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 11 [2019-11-28 16:49:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:16,744 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-28 16:49:16,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:49:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-28 16:49:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 16:49:16,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:16,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:16,745 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1606867070, now seen corresponding path program 1 times [2019-11-28 16:49:16,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:16,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304053707] [2019-11-28 16:49:16,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:49:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:49:16,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:49:16,866 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:49:16,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:49:16 BoogieIcfgContainer [2019-11-28 16:49:16,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:49:16,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:49:16,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:49:16,896 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:49:16,896 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:16" (3/4) ... [2019-11-28 16:49:16,900 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 16:49:16,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:49:16,903 INFO L168 Benchmark]: Toolchain (without parser) took 1402.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -100.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:16,904 INFO L168 Benchmark]: CDTParser took 0.88 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:49:16,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:16,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.71 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:16,906 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 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:16,907 INFO L168 Benchmark]: RCFGBuilder took 481.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:16,908 INFO L168 Benchmark]: TraceAbstraction took 439.66 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:16,909 INFO L168 Benchmark]: Witness Printer took 5.16 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:16,914 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.88 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 380.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.71 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. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 481.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 439.66 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.16 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 91]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 34, overapproximation of someUnaryDOUBLEoperation at line 86, overapproximation of bitwiseAnd at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L86] double x = -0.0; [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L27] COND TRUE exponent_less_1023 < 20 [L28] COND FALSE !(exponent_less_1023 < 0) [L34] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; [L35] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L36] return x; [L87] double res = round_double(x); [L90] EXPR res == -0.0 && __signbit_double(res) == 1 [L90] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L91] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 16:49:19,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:49:19,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:49:19,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:49:19,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:49:19,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:49:19,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:49:19,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:49:19,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:49:19,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:49:19,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:49:19,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:49:19,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:49:19,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:49:19,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:49:19,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:49:19,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:49:19,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:49:19,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:49:19,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:49:19,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:49:19,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:49:19,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:49:19,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:49:19,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:49:19,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:49:19,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:49:19,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:49:19,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:49:19,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:49:19,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:49:19,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:49:19,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:49:19,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:49:19,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:49:19,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:49:19,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:49:19,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:49:19,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:49:19,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:49:19,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:49:19,183 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:49:19,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:49:19,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:49:19,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:49:19,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:49:19,220 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:49:19,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:49:19,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:49:19,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:49:19,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:49:19,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:49:19,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:49:19,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:49:19,222 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 16:49:19,222 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 16:49:19,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:49:19,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:49:19,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:49:19,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:49:19,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:49:19,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:49:19,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:49:19,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:49:19,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:19,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:49:19,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:49:19,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:49:19,228 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 16:49:19,228 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 16:49:19,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:49:19,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:49:19,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 16:49:19,232 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 -> 2fc40f01120ca51e77cbf79a7824b0aac7011828 [2019-11-28 16:49:19,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:49:19,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:49:19,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:49:19,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:49:19,572 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:49:19,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1032b.c [2019-11-28 16:49:19,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af51b4394/bb607931b8864216a0fe35b11c424ae8/FLAG9e7e7b823 [2019-11-28 16:49:20,158 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:49:20,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032b.c [2019-11-28 16:49:20,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af51b4394/bb607931b8864216a0fe35b11c424ae8/FLAG9e7e7b823 [2019-11-28 16:49:20,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af51b4394/bb607931b8864216a0fe35b11c424ae8 [2019-11-28 16:49:20,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:49:20,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:49:20,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:20,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:49:20,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:49:20,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:20" (1/1) ... [2019-11-28 16:49:20,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212f942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:20, skipping insertion in model container [2019-11-28 16:49:20,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:20" (1/1) ... [2019-11-28 16:49:20,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:49:20,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:49:20,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:20,856 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:49:20,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:20,985 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:49:20,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:20 WrapperNode [2019-11-28 16:49:20,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:20,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:20,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:49:20,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:49:20,995 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:20" (1/1) ... [2019-11-28 16:49:21,006 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:20" (1/1) ... [2019-11-28 16:49:21,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:21,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:49:21,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:49:21,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:49:21,043 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:20" (1/1) ... [2019-11-28 16:49:21,044 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:20" (1/1) ... [2019-11-28 16:49:21,048 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:20" (1/1) ... [2019-11-28 16:49:21,049 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:20" (1/1) ... [2019-11-28 16:49:21,060 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:20" (1/1) ... [2019-11-28 16:49:21,066 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:20" (1/1) ... [2019-11-28 16:49:21,069 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:20" (1/1) ... [2019-11-28 16:49:21,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:49:21,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:49:21,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:49:21,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:49:21,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:20" (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:21,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-28 16:49:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-28 16:49:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:49:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 16:49:21,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:49:21,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:49:21,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 16:49:21,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:49:21,602 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:49:21,603 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 16:49:21,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:21 BoogieIcfgContainer [2019-11-28 16:49:21,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:49:21,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:49:21,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:49:21,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:49:21,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:49:20" (1/3) ... [2019-11-28 16:49:21,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ca6fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:21, skipping insertion in model container [2019-11-28 16:49:21,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:20" (2/3) ... [2019-11-28 16:49:21,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ca6fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:21, skipping insertion in model container [2019-11-28 16:49:21,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:21" (3/3) ... [2019-11-28 16:49:21,613 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032b.c [2019-11-28 16:49:21,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:49:21,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:49:21,642 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:49:21,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:49:21,664 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:49:21,664 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:49:21,664 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:49:21,665 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:49:21,665 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:49:21,665 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:49:21,665 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:49:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-28 16:49:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:49:21,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:21,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:21,692 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2068179301, now seen corresponding path program 1 times [2019-11-28 16:49:21,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:49:21,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917633483] [2019-11-28 16:49:21,708 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:49:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:21,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 16:49:21,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:49:21,823 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:21,823 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:49:21,829 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:21,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917633483] [2019-11-28 16:49:21,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:21,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 16:49:21,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181859399] [2019-11-28 16:49:21,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:49:21,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:49:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:49:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:21,857 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-28 16:49:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:21,885 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2019-11-28 16:49:21,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:49:21,886 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-28 16:49:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:21,904 INFO L225 Difference]: With dead ends: 58 [2019-11-28 16:49:21,904 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:49:21,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:49:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:49:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:49:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-28 16:49:21,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 11 [2019-11-28 16:49:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:21,945 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-28 16:49:21,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:49:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-28 16:49:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 16:49:21,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:21,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:22,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 16:49:22,160 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1606867070, now seen corresponding path program 1 times [2019-11-28 16:49:22,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:49:22,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552645412] [2019-11-28 16:49:22,163 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:49:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:22,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:49:22,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:49:22,357 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:22,360 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:49:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:49:22,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552645412] [2019-11-28 16:49:22,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:22,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-28 16:49:22,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716475771] [2019-11-28 16:49:22,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:49:22,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:49:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:49:22,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:49:22,457 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 8 states. [2019-11-28 16:49:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:22,698 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-11-28 16:49:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:49:22,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-28 16:49:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:22,700 INFO L225 Difference]: With dead ends: 40 [2019-11-28 16:49:22,700 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 16:49:22,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:49:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 16:49:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 16:49:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 16:49:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-11-28 16:49:22,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2019-11-28 16:49:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:22,709 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-11-28 16:49:22,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:49:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-11-28 16:49:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:49:22,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:22,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:22,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 16:49:22,924 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1282802547, now seen corresponding path program 1 times [2019-11-28 16:49:22,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:49:22,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637111387] [2019-11-28 16:49:22,926 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:49:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:23,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 16:49:23,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:49:23,113 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:49:23,118 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:49:23,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:23,124 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:49:23,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:23,129 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:49:23,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-28 16:49:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:49:23,199 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:23,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:49:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:49:23,261 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 46 treesize of output 40 [2019-11-28 16:49:23,264 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:49:23,268 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:23,269 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:49:23,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:23,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:49:23,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:16 [2019-11-28 16:49:23,328 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:23,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637111387] [2019-11-28 16:49:23,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:23,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-28 16:49:23,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525917399] [2019-11-28 16:49:23,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 16:49:23,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:49:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 16:49:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:49:23,332 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2019-11-28 16:49:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:23,761 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-28 16:49:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:49:23,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-28 16:49:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:23,764 INFO L225 Difference]: With dead ends: 24 [2019-11-28 16:49:23,764 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 16:49:23,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:49:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 16:49:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 16:49:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 16:49:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2019-11-28 16:49:23,782 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2019-11-28 16:49:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:23,784 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2019-11-28 16:49:23,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 16:49:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2019-11-28 16:49:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:49:23,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:23,787 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:24,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 16:49:24,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash 218634850, now seen corresponding path program 1 times [2019-11-28 16:49:24,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:49:24,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734253390] [2019-11-28 16:49:24,005 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:49:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:24,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 16:49:24,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:49:24,184 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 48 treesize of output 42 [2019-11-28 16:49:24,189 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:49:24,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:24,194 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:49:24,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:24,206 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:49:24,207 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:29 [2019-11-28 16:49:24,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:49:24,444 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:24,444 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:49:24,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:49:24,769 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 52 treesize of output 46 [2019-11-28 16:49:24,784 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:49:24,787 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:24,787 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:49:24,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:49:24,799 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:49:24,799 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:30 [2019-11-28 16:49:27,136 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:27,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734253390] [2019-11-28 16:49:27,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:27,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2019-11-28 16:49:27,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040541141] [2019-11-28 16:49:27,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 16:49:27,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:49:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 16:49:27,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=263, Unknown=1, NotChecked=0, Total=306 [2019-11-28 16:49:27,140 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 18 states. [2019-11-28 16:49:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:28,047 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-11-28 16:49:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:49:28,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-11-28 16:49:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:28,049 INFO L225 Difference]: With dead ends: 21 [2019-11-28 16:49:28,049 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:49:28,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=140, Invalid=459, Unknown=1, NotChecked=0, Total=600 [2019-11-28 16:49:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:49:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:49:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:49:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:49:28,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-11-28 16:49:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:28,052 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:49:28,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 16:49:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:49:28,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:49:28,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 16:49:28,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:49:28,483 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 16:49:28,798 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-11-28 16:49:29,027 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-28 16:49:29,031 INFO L246 CegarLoopResult]: For program point L27(lines 27 56) no Hoare annotation was computed. [2019-11-28 16:49:29,031 INFO L246 CegarLoopResult]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-28 16:49:29,031 INFO L246 CegarLoopResult]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2019-11-28 16:49:29,031 INFO L246 CegarLoopResult]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-28 16:49:29,032 INFO L242 CegarLoopResult]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_round_double_~lsw~0) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~x (let ((.cse0 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_ULTIMATE.start_round_double_~msw~0_18 (_ BitVec 32))) (= ULTIMATE.start_round_double_~x (let ((.cse2 (concat (bvand (_ bv2147483648 32) v_ULTIMATE.start_round_double_~msw~0_18) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) |ULTIMATE.start_main_#t~short10| (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_round_double_~x (let ((.cse3 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_round_double_~exponent_less_1023~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (fp.eq |ULTIMATE.start_round_double_#res| (fp.neg (_ +zero 11 53))) (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_round_double_#res|) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53)))))) [2019-11-28 16:49:29,032 INFO L246 CegarLoopResult]: For program point L69-3(lines 69 73) no Hoare annotation was computed. [2019-11-28 16:49:29,032 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:49:29,032 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:49:29,033 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:49:29,033 INFO L246 CegarLoopResult]: For program point L28(lines 28 40) no Hoare annotation was computed. [2019-11-28 16:49:29,033 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-28 16:49:29,034 INFO L246 CegarLoopResult]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-11-28 16:49:29,034 INFO L246 CegarLoopResult]: For program point L57-1(lines 17 64) no Hoare annotation was computed. [2019-11-28 16:49:29,034 INFO L246 CegarLoopResult]: For program point L90-2(lines 90 93) no Hoare annotation was computed. [2019-11-28 16:49:29,034 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-11-28 16:49:29,035 INFO L246 CegarLoopResult]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2019-11-28 16:49:29,035 INFO L246 CegarLoopResult]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-28 16:49:29,035 INFO L242 CegarLoopResult]: At program point L20-2(lines 20 25) the Hoare annotation is: (= ULTIMATE.start_round_double_~x (fp.neg (_ +zero 11 53))) [2019-11-28 16:49:29,035 INFO L246 CegarLoopResult]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2019-11-28 16:49:29,036 INFO L246 CegarLoopResult]: For program point L49(lines 49 50) no Hoare annotation was computed. [2019-11-28 16:49:29,036 INFO L246 CegarLoopResult]: For program point L41(lines 41 56) no Hoare annotation was computed. [2019-11-28 16:49:29,036 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:49:29,036 INFO L249 CegarLoopResult]: At program point L95(lines 78 96) the Hoare annotation is: true [2019-11-28 16:49:29,036 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-28 16:49:29,037 INFO L242 CegarLoopResult]: At program point L75(lines 66 76) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_round_double_~lsw~0) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~x (let ((.cse0 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64)) (v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (exists ((v_ULTIMATE.start_round_double_~msw~0_18 (_ BitVec 32))) (= ULTIMATE.start_round_double_~x (let ((.cse3 (concat (bvand (_ bv2147483648 32) v_ULTIMATE.start_round_double_~msw~0_18) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) |ULTIMATE.start_main_#t~short10| (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_round_double_~x (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_round_double_~exponent_less_1023~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (fp.eq |ULTIMATE.start_round_double_#res| (fp.neg (_ +zero 11 53))) (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (let ((.cse5 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) |ULTIMATE.start_round_double_#res|) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53)))))) [2019-11-28 16:49:29,037 INFO L246 CegarLoopResult]: For program point L42(lines 42 45) no Hoare annotation was computed. [2019-11-28 16:49:29,038 INFO L242 CegarLoopResult]: At program point L63(lines 17 64) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_round_double_~lsw~0) (exists ((v_ULTIMATE.start_round_double_~msw~0_18 (_ BitVec 32))) (= ULTIMATE.start_round_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) v_ULTIMATE.start_round_double_~msw~0_18) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_round_double_~x (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_round_double_~exponent_less_1023~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (fp.eq |ULTIMATE.start_round_double_#res| (fp.neg (_ +zero 11 53))) (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53))))) (exists ((ULTIMATE.start_round_double_~lsw~0 (_ BitVec 32)) (v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start_round_double_~lsw~0))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_round_double_#res|) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) (fp.neg (_ +zero 11 53)))))) [2019-11-28 16:49:29,038 INFO L246 CegarLoopResult]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-28 16:49:29,038 INFO L246 CegarLoopResult]: For program point L30-2(lines 30 31) no Hoare annotation was computed. [2019-11-28 16:49:29,039 INFO L246 CegarLoopResult]: For program point L35(lines 35 36) no Hoare annotation was computed. [2019-11-28 16:49:29,046 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: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:49:29,051 INFO L168 Benchmark]: Toolchain (without parser) took 8509.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 955.0 MB in the beginning and 844.0 MB in the end (delta: 111.0 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:29,052 INFO L168 Benchmark]: CDTParser took 0.33 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:29,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:29,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.47 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:29,054 INFO L168 Benchmark]: Boogie Preprocessor took 39.22 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:29,055 INFO L168 Benchmark]: RCFGBuilder took 531.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:29,056 INFO L168 Benchmark]: TraceAbstraction took 7443.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.0 MB in the end (delta: 266.5 MB). Peak memory consumption was 266.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:29,059 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.33 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 442.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.47 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 39.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 531.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7443.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.0 MB in the end (delta: 266.5 MB). Peak memory consumption was 266.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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...