./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:45:25,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:45:25,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:45:25,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:45:25,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:45:25,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:45:25,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:45:25,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:45:25,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:45:25,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:45:25,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:45:25,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:45:25,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:45:25,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:45:25,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:45:25,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:45:25,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:45:25,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:45:25,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:45:25,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:45:26,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:45:26,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:45:26,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:45:26,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:45:26,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:45:26,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:45:26,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:45:26,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:45:26,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:45:26,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:45:26,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:45:26,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:45:26,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:45:26,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:45:26,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:45:26,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:45:26,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:45:26,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:45:26,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:45:26,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:45:26,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:45:26,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:45:26,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:45:26,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:45:26,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:45:26,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:45:26,051 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:45:26,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:45:26,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:45:26,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:45:26,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:45:26,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:45:26,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:45:26,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:45:26,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:45:26,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:45:26,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:45:26,055 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:45:26,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:45:26,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:45:26,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:45:26,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:45:26,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:45:26,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:26,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:45:26,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:45:26,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:45:26,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:45:26,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:45:26,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:45:26,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2019-11-27 23:45:26,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:45:26,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:45:26,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:45:26,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:45:26,357 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:45:26,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-27 23:45:26,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead164a92/f8c1b3f11a024fb3a776c4a02be756ae/FLAGcea52943a [2019-11-27 23:45:26,928 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:45:26,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-27 23:45:26,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead164a92/f8c1b3f11a024fb3a776c4a02be756ae/FLAGcea52943a [2019-11-27 23:45:27,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead164a92/f8c1b3f11a024fb3a776c4a02be756ae [2019-11-27 23:45:27,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:45:27,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:45:27,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:27,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:45:27,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:45:27,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cfe08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27, skipping insertion in model container [2019-11-27 23:45:27,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:45:27,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:45:27,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:27,557 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:45:27,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:27,682 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:45:27,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27 WrapperNode [2019-11-27 23:45:27,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:27,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:27,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:45:27,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:45:27,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:27,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:45:27,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:45:27,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:45:27,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:45:27,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:45:27,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:45:27,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:45:27,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (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-27 23:45:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:45:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-27 23:45:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:45:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:45:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:45:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:45:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-27 23:45:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:45:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:45:28,458 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:45:28,458 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:45:28,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:28 BoogieIcfgContainer [2019-11-27 23:45:28,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:45:28,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:45:28,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:45:28,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:45:28,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:45:27" (1/3) ... [2019-11-27 23:45:28,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dc89b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:28, skipping insertion in model container [2019-11-27 23:45:28,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (2/3) ... [2019-11-27 23:45:28,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dc89b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:28, skipping insertion in model container [2019-11-27 23:45:28,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:28" (3/3) ... [2019-11-27 23:45:28,471 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-11-27 23:45:28,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:45:28,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:45:28,503 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:45:28,523 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:45:28,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:45:28,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:45:28,523 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:45:28,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:45:28,524 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:45:28,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:45:28,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:45:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-27 23:45:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:45:28,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:28,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:28,544 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-27 23:45:28,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:28,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950778406] [2019-11-27 23:45:28,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:28,684 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-27 23:45:28,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950778406] [2019-11-27 23:45:28,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:28,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:45:28,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710095284] [2019-11-27 23:45:28,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:45:28,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:45:28,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:28,703 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-27 23:45:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:28,730 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-27 23:45:28,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:45:28,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-27 23:45:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:28,743 INFO L225 Difference]: With dead ends: 102 [2019-11-27 23:45:28,743 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:45:28,747 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-27 23:45:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:45:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-27 23:45:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:45:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-27 23:45:28,780 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-27 23:45:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:28,780 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-27 23:45:28,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:45:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-27 23:45:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:45:28,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:28,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:28,782 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-27 23:45:28,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:28,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516354115] [2019-11-27 23:45:28,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:28,950 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-27 23:45:28,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516354115] [2019-11-27 23:45:28,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:28,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:45:28,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002607536] [2019-11-27 23:45:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:45:28,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:45:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:28,954 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2019-11-27 23:45:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:28,972 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-27 23:45:28,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:45:28,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 23:45:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:28,974 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:45:28,974 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:45:28,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:45:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-27 23:45:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:45:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-27 23:45:28,982 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2019-11-27 23:45:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:28,983 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-27 23:45:28,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:45:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-27 23:45:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:45:28,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:28,984 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-27 23:45:28,985 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2019-11-27 23:45:28,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:28,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748743977] [2019-11-27 23:45:28,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:45:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:45:29,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:45:29,210 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:45:29,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:45:29 BoogieIcfgContainer [2019-11-27 23:45:29,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:45:29,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:45:29,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:45:29,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:45:29,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:28" (3/4) ... [2019-11-27 23:45:29,271 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:45:29,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:45:29,274 INFO L168 Benchmark]: Toolchain (without parser) took 2015.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -73.7 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:29,275 INFO L168 Benchmark]: CDTParser took 0.26 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-27 23:45:29,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:29,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.73 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-27 23:45:29,279 INFO L168 Benchmark]: Boogie Preprocessor took 70.74 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-27 23:45:29,281 INFO L168 Benchmark]: RCFGBuilder took 647.58 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:29,283 INFO L168 Benchmark]: TraceAbstraction took 798.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:29,284 INFO L168 Benchmark]: Witness Printer took 10.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:29,299 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.26 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 425.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.73 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 70.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 647.58 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 798.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. * Witness Printer took 10.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [one_modf=1] [L144] double x = -1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [one_modf=1] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [one_modf=1] [L30] COND TRUE j0 < 20 VAL [one_modf=1] [L31] COND TRUE j0 < 0 VAL [one_modf=1] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [one_modf=1] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) [L112] __int32_t hx, lx; VAL [one_modf=1] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 0 SDslu, 49 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:45:31,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:45:31,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:45:31,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:45:31,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:45:31,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:45:31,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:45:31,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:45:31,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:45:31,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:45:31,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:45:31,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:45:31,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:45:31,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:45:31,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:45:31,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:45:31,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:45:31,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:45:31,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:45:31,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:45:31,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:45:31,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:45:31,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:45:31,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:45:31,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:45:31,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:45:31,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:45:31,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:45:31,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:45:31,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:45:31,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:45:31,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:45:31,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:45:31,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:45:31,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:45:31,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:45:31,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:45:31,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:45:31,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:45:31,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:45:31,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:45:31,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:45:31,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:45:31,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:45:31,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:45:31,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:45:31,337 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:45:31,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:45:31,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:45:31,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:45:31,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:45:31,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:45:31,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:45:31,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:45:31,339 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:45:31,339 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:45:31,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:45:31,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:45:31,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:45:31,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:45:31,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:45:31,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:45:31,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:45:31,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:45:31,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:31,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:45:31,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:45:31,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:45:31,343 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:45:31,343 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:45:31,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:45:31,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:45:31,344 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2019-11-27 23:45:31,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:45:31,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:45:31,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:45:31,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:45:31,647 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:45:31,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-27 23:45:31,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ceff088/0df67e7d89ef4ff9914a6fb1a9dfb777/FLAGf7e162878 [2019-11-27 23:45:32,171 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:45:32,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-27 23:45:32,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ceff088/0df67e7d89ef4ff9914a6fb1a9dfb777/FLAGf7e162878 [2019-11-27 23:45:32,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ceff088/0df67e7d89ef4ff9914a6fb1a9dfb777 [2019-11-27 23:45:32,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:45:32,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:45:32,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:32,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:45:32,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:45:32,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32, skipping insertion in model container [2019-11-27 23:45:32,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:45:32,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:45:32,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:32,816 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:45:32,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:32,962 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:45:32,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32 WrapperNode [2019-11-27 23:45:32,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:32,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:32,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:45:32,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:45:32,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:33,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:45:33,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:45:33,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:45:33,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:33,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:45:33,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:45:33,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:45:33,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:45:33,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (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-27 23:45:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-27 23:45:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-27 23:45:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:45:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-27 23:45:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:45:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:45:33,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:45:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 23:45:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:45:34,278 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:45:34,279 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:45:34,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:34 BoogieIcfgContainer [2019-11-27 23:45:34,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:45:34,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:45:34,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:45:34,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:45:34,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:45:32" (1/3) ... [2019-11-27 23:45:34,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383eae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:34, skipping insertion in model container [2019-11-27 23:45:34,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (2/3) ... [2019-11-27 23:45:34,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383eae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:34, skipping insertion in model container [2019-11-27 23:45:34,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:34" (3/3) ... [2019-11-27 23:45:34,289 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-11-27 23:45:34,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:45:34,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:45:34,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:45:34,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:45:34,344 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:45:34,344 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:45:34,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:45:34,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:45:34,345 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:45:34,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:45:34,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:45:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-27 23:45:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:45:34,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:34,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:34,366 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:34,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-27 23:45:34,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:34,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697402526] [2019-11-27 23:45:34,380 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-27 23:45:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:34,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:45:34,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:34,551 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-27 23:45:34,551 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:34,555 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-27 23:45:34,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697402526] [2019-11-27 23:45:34,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:34,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:45:34,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882186523] [2019-11-27 23:45:34,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:45:34,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:45:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:34,580 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-27 23:45:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:34,605 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-27 23:45:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:45:34,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-27 23:45:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:34,616 INFO L225 Difference]: With dead ends: 102 [2019-11-27 23:45:34,616 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:45:34,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:45:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-27 23:45:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:45:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-27 23:45:34,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-27 23:45:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:34,656 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-27 23:45:34,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:45:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-27 23:45:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:45:34,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:34,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:34,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:45:34,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-27 23:45:34,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:34,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807047873] [2019-11-27 23:45:34,876 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-27 23:45:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:35,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:45:35,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:35,206 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-27 23:45:35,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:35,359 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-27 23:45:35,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807047873] [2019-11-27 23:45:35,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:35,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-27 23:45:35,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475729890] [2019-11-27 23:45:35,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:45:35,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:35,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:45:35,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:45:35,364 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-11-27 23:45:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:36,220 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-27 23:45:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:45:36,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-27 23:45:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:36,222 INFO L225 Difference]: With dead ends: 64 [2019-11-27 23:45:36,222 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:36,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:45:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-27 23:45:36,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-11-27 23:45:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:36,231 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-27 23:45:36,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:45:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-27 23:45:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:45:36,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:36,232 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-27 23:45:36,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:45:36,447 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-11-27 23:45:36,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:36,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026016321] [2019-11-27 23:45:36,451 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-27 23:45:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:36,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:45:36,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:36,954 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-27 23:45:36,954 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:36,957 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-27 23:45:36,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026016321] [2019-11-27 23:45:36,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:36,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 23:45:36,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101262631] [2019-11-27 23:45:36,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:45:36,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:36,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:45:36,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:36,960 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-11-27 23:45:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:36,984 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-27 23:45:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:45:36,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 23:45:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:36,986 INFO L225 Difference]: With dead ends: 30 [2019-11-27 23:45:36,986 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:36,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-27 23:45:36,993 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-11-27 23:45:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:36,993 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-27 23:45:36,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:45:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-27 23:45:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:45:36,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:36,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:37,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:45:37,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:37,217 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-11-27 23:45:37,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:37,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374688239] [2019-11-27 23:45:37,218 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-27 23:45:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:37,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:45:37,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:37,625 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-27 23:45:37,630 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:45:37,634 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:37,635 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:45:37,637 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:37,637 INFO L508 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-27 23:45:37,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-27 23:45:37,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:37,721 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:37,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:37,802 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-27 23:45:37,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374688239] [2019-11-27 23:45:37,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:37,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-27 23:45:37,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505776887] [2019-11-27 23:45:37,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:45:37,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:45:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:45:37,805 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-11-27 23:45:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:38,360 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-11-27 23:45:38,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:45:38,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-27 23:45:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:38,364 INFO L225 Difference]: With dead ends: 31 [2019-11-27 23:45:38,364 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:38,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:45:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-27 23:45:38,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-11-27 23:45:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:38,372 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-27 23:45:38,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:45:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-27 23:45:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:45:38,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:38,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:38,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:45:38,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-11-27 23:45:38,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:38,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895499971] [2019-11-27 23:45:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:39,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 23:45:39,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:39,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-27 23:45:39,096 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:45:39,099 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:39,100 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:45:39,122 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:39,123 INFO L508 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-27 23:45:39,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:40 [2019-11-27 23:45:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:39,680 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-27 23:45:39,681 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:39,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:39,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:40,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2019-11-27 23:45:40,201 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:45:40,227 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:40,228 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:45:40,234 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:40,235 INFO L508 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-27 23:45:40,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:36 [2019-11-27 23:45:40,494 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-27 23:45:40,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895499971] [2019-11-27 23:45:40,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:40,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-11-27 23:45:40,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863097176] [2019-11-27 23:45:40,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 23:45:40,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 23:45:40,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:45:40,498 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-11-27 23:45:42,873 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-27 23:45:43,234 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 23:45:43,477 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-27 23:45:43,784 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-27 23:45:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:43,785 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-27 23:45:43,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:45:43,785 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-27 23:45:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:43,786 INFO L225 Difference]: With dead ends: 27 [2019-11-27 23:45:43,786 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:45:43,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-27 23:45:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:45:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:45:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:45:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:45:43,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-27 23:45:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:43,788 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:45:43,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 23:45:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:45:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:45:43,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:45:43,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:45:44,447 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-27 23:45:44,751 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-27 23:45:45,269 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-27 23:45:45,669 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-27 23:45:45,886 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-11-27 23:45:45,949 INFO L246 CegarLoopResult]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-11-27 23:45:45,950 INFO L242 CegarLoopResult]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-11-27 23:45:45,950 INFO L246 CegarLoopResult]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-27 23:45:45,950 INFO L242 CegarLoopResult]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x))) [2019-11-27 23:45:45,950 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,950 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,950 INFO L246 CegarLoopResult]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-11-27 23:45:45,950 INFO L242 CegarLoopResult]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-11-27 23:45:45,951 INFO L246 CegarLoopResult]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-27 23:45:45,951 INFO L242 CegarLoopResult]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ULTIMATE.start___signbit_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)))))) [2019-11-27 23:45:45,951 INFO L246 CegarLoopResult]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-27 23:45:45,951 INFO L246 CegarLoopResult]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-11-27 23:45:45,951 INFO L249 CegarLoopResult]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-11-27 23:45:45,951 INFO L246 CegarLoopResult]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-11-27 23:45:45,952 INFO L242 CegarLoopResult]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|)))) [2019-11-27 23:45:45,952 INFO L246 CegarLoopResult]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-11-27 23:45:45,952 INFO L242 CegarLoopResult]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|)))) [2019-11-27 23:45:45,952 INFO L246 CegarLoopResult]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-11-27 23:45:45,952 INFO L242 CegarLoopResult]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|)))) [2019-11-27 23:45:45,953 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-11-27 23:45:45,953 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 28) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) [2019-11-27 23:45:45,953 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-11-27 23:45:45,953 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,953 INFO L246 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-11-27 23:45:45,953 INFO L242 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-11-27 23:45:45,954 INFO L246 CegarLoopResult]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-11-27 23:45:45,954 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-27 23:45:45,954 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-27 23:45:45,954 INFO L242 CegarLoopResult]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-11-27 23:45:45,954 INFO L246 CegarLoopResult]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-11-27 23:45:45,955 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-27 23:45:45,956 INFO L246 CegarLoopResult]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-11-27 23:45:45,957 INFO L246 CegarLoopResult]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-11-27 23:45:45,957 INFO L246 CegarLoopResult]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-11-27 23:45:45,957 INFO L246 CegarLoopResult]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-11-27 23:45:45,957 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-27 23:45:45,957 INFO L242 CegarLoopResult]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse4 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) ULTIMATE.start___signbit_double_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)))))) [2019-11-27 23:45:45,962 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 23:45:45,966 INFO L168 Benchmark]: Toolchain (without parser) took 13422.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,967 INFO L168 Benchmark]: CDTParser took 0.19 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-27 23:45:45,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.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-27 23:45:45,969 INFO L168 Benchmark]: Boogie Preprocessor took 58.81 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,970 INFO L168 Benchmark]: RCFGBuilder took 1199.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,971 INFO L168 Benchmark]: TraceAbstraction took 11683.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.6 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,974 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.19 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 418.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.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. * Boogie Preprocessor took 58.81 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1199.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11683.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.6 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...