./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211a.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 98b359d4210eaa0693e17be51fa07ce179f3b890 ...................................................................................................................................................................................................................................................................................................................................................... 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_1211a.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 98b359d4210eaa0693e17be51fa07ce179f3b890 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:49:53,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:49:53,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:49:54,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:49:54,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:49:54,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:49:54,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:49:54,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:49:54,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:49:54,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:49:54,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:49:54,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:49:54,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:49:54,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:49:54,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:49:54,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:49:54,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:49:54,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:49:54,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:49:54,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:49:54,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:49:54,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:49:54,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:49:54,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:49:54,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:49:54,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:49:54,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:49:54,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:49:54,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:49:54,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:49:54,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:49:54,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:49:54,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:49:54,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:49:54,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:49:54,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:49:54,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:49:54,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:49:54,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:49:54,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:49:54,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:49:54,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:49:54,092 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:49:54,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:49:54,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:49:54,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:49:54,094 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:49:54,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:49:54,095 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:49:54,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:49:54,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:49:54,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:49:54,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:49:54,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:49:54,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:49:54,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:49:54,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:49:54,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:49:54,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:49:54,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:49:54,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:49:54,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:49:54,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:49:54,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:54,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:49:54,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:49:54,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:49:54,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:49:54,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:49:54,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:49:54,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:49:54,100 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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2019-11-28 16:49:54,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:49:54,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:49:54,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:49:54,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:49:54,437 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:49:54,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-28 16:49:54,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da79a3e83/087eb8145b3343b19bf35be1d763755b/FLAG682ebc15c [2019-11-28 16:49:54,959 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:49:54,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-28 16:49:54,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da79a3e83/087eb8145b3343b19bf35be1d763755b/FLAG682ebc15c [2019-11-28 16:49:55,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da79a3e83/087eb8145b3343b19bf35be1d763755b [2019-11-28 16:49:55,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:49:55,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:49:55,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:55,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:49:55,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:49:55,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177923f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55, skipping insertion in model container [2019-11-28 16:49:55,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:49:55,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:49:55,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:55,618 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:49:55,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:55,756 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:49:55,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55 WrapperNode [2019-11-28 16:49:55,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:55,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:55,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:49:55,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:49:55,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:55,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:49:55,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:49:55,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:49:55,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... [2019-11-28 16:49:55,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:49:55,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:49:55,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:49:55,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:49:55,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:49:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-28 16:49:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:49:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-28 16:49:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:49:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:49:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-28 16:49:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:49:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:49:56,514 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:49:56,515 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 16:49:56,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:56 BoogieIcfgContainer [2019-11-28 16:49:56,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:49:56,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:49:56,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:49:56,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:49:56,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:49:55" (1/3) ... [2019-11-28 16:49:56,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dee8b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:56, skipping insertion in model container [2019-11-28 16:49:56,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:55" (2/3) ... [2019-11-28 16:49:56,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dee8b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:56, skipping insertion in model container [2019-11-28 16:49:56,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:56" (3/3) ... [2019-11-28 16:49:56,524 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a.c [2019-11-28 16:49:56,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:49:56,541 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:49:56,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:49:56,575 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:49:56,575 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:49:56,575 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:49:56,575 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:49:56,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:49:56,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:49:56,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:49:56,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:49:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-28 16:49:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:49:56,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:56,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:56,596 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-28 16:49:56,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:56,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597879295] [2019-11-28 16:49:56,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:49:56,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597879295] [2019-11-28 16:49:56,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:56,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:49:56,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284265231] [2019-11-28 16:49:56,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:49:56,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:49:56,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:49:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:56,749 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-28 16:49:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:56,774 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-28 16:49:56,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:49:56,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-28 16:49:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:56,787 INFO L225 Difference]: With dead ends: 102 [2019-11-28 16:49:56,787 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:49:56,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:49:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 16:49:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 16:49:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-28 16:49:56,825 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-28 16:49:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:56,825 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-28 16:49:56,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:49:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-28 16:49:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:49:56,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:56,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:56,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-28 16:49:56,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:56,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661414215] [2019-11-28 16:49:56,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:49:57,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661414215] [2019-11-28 16:49:57,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:57,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:49:57,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176430546] [2019-11-28 16:49:57,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:49:57,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:49:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:49:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:49:57,007 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2019-11-28 16:49:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:57,041 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 16:49:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:49:57,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 16:49:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:57,045 INFO L225 Difference]: With dead ends: 52 [2019-11-28 16:49:57,045 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:49:57,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:49:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:49:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 16:49:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 16:49:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-28 16:49:57,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2019-11-28 16:49:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:57,059 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-28 16:49:57,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:49:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-28 16:49:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:49:57,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:57,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:57,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2019-11-28 16:49:57,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:57,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359017736] [2019-11-28 16:49:57,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:49:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:49:57,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:49:57,348 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:49:57,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:49:57 BoogieIcfgContainer [2019-11-28 16:49:57,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:49:57,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:49:57,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:49:57,417 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:49:57,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:56" (3/4) ... [2019-11-28 16:49:57,422 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 16:49:57,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:49:57,426 INFO L168 Benchmark]: Toolchain (without parser) took 2092.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -54.0 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:57,427 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:49:57,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:57,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:49:57,431 INFO L168 Benchmark]: Boogie Preprocessor took 67.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:57,432 INFO L168 Benchmark]: RCFGBuilder took 629.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:57,434 INFO L168 Benchmark]: TraceAbstraction took 895.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:49:57,436 INFO L168 Benchmark]: Witness Printer took 9.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:49:57,451 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.75 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 424.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 629.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 895.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Witness Printer took 9.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [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.7s, 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.25-f470102 [2019-11-28 16:49:59,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:49:59,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:49:59,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:49:59,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:49:59,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:49:59,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:49:59,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:49:59,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:49:59,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:49:59,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:49:59,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:49:59,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:49:59,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:49:59,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:49:59,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:49:59,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:49:59,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:49:59,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:49:59,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:49:59,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:49:59,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:49:59,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:49:59,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:49:59,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:49:59,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:49:59,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:49:59,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:49:59,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:49:59,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:49:59,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:49:59,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:49:59,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:49:59,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:49:59,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:49:59,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:49:59,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:49:59,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:49:59,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:49:59,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:49:59,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:49:59,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 16:49:59,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:49:59,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:49:59,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:49:59,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:49:59,501 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:49:59,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:49:59,501 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:49:59,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:49:59,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:49:59,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:49:59,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:49:59,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:49:59,502 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 16:49:59,505 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 16:49:59,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:49:59,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:49:59,505 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:49:59,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:49:59,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:49:59,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:49:59,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:49:59,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:49:59,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:59,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:49:59,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:49:59,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:49:59,507 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 16:49:59,508 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 16:49:59,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:49:59,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:49:59,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 16:49:59,509 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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2019-11-28 16:49:59,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:49:59,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:49:59,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:49:59,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:49:59,862 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:49:59,863 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-28 16:49:59,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc91b6378/782178d19e8d4371b2f35d10bff90323/FLAG9ae2f961e [2019-11-28 16:50:00,338 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:50:00,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-28 16:50:00,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc91b6378/782178d19e8d4371b2f35d10bff90323/FLAG9ae2f961e [2019-11-28 16:50:00,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc91b6378/782178d19e8d4371b2f35d10bff90323 [2019-11-28 16:50:00,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:50:00,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:50:00,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:00,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:50:00,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:50:00,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:00" (1/1) ... [2019-11-28 16:50:00,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c44cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:00, skipping insertion in model container [2019-11-28 16:50:00,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:00" (1/1) ... [2019-11-28 16:50:00,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:50:00,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:50:01,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:01,104 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:50:01,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:01,179 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:50:01,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01 WrapperNode [2019-11-28 16:50:01,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:01,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:01,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:50:01,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:50:01,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:01,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:50:01,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:50:01,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:50:01,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... [2019-11-28 16:50:01,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:50:01,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:50:01,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:50:01,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:50:01,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:50:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-28 16:50:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-28 16:50:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:50:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-28 16:50:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 16:50:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:50:01,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:50:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 16:50:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:50:02,709 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:50:02,709 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 16:50:02,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:02 BoogieIcfgContainer [2019-11-28 16:50:02,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:50:02,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:50:02,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:50:02,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:50:02,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:50:00" (1/3) ... [2019-11-28 16:50:02,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76dd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:02, skipping insertion in model container [2019-11-28 16:50:02,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:01" (2/3) ... [2019-11-28 16:50:02,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76dd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:02, skipping insertion in model container [2019-11-28 16:50:02,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:02" (3/3) ... [2019-11-28 16:50:02,721 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a.c [2019-11-28 16:50:02,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:50:02,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:50:02,750 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:50:02,778 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:50:02,778 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:50:02,778 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:50:02,778 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:50:02,779 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:50:02,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:50:02,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:50:02,779 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:50:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-28 16:50:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:50:02,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:02,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:02,800 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-28 16:50:02,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:02,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42070206] [2019-11-28 16:50:02,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:02,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 16:50:02,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:02,980 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:02,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42070206] [2019-11-28 16:50:02,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:02,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 16:50:02,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451012665] [2019-11-28 16:50:02,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:50:03,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:50:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:03,019 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-28 16:50:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:03,056 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-28 16:50:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:50:03,058 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-28 16:50:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:03,078 INFO L225 Difference]: With dead ends: 102 [2019-11-28 16:50:03,078 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:50:03,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:50:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 16:50:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 16:50:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-28 16:50:03,112 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-28 16:50:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:03,113 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-28 16:50:03,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:50:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-28 16:50:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:50:03,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:03,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:03,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 16:50:03,328 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-28 16:50:03,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:03,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786813471] [2019-11-28 16:50:03,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:03,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:50:03,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:03,649 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:03,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786813471] [2019-11-28 16:50:03,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:03,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-28 16:50:03,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930020624] [2019-11-28 16:50:03,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:50:03,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:50:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:50:03,806 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-11-28 16:50:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:04,959 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-28 16:50:04,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:04,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 16:50:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:04,961 INFO L225 Difference]: With dead ends: 64 [2019-11-28 16:50:04,962 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:04,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:50:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 16:50:04,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-11-28 16:50:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:04,979 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 16:50:04,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:50:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 16:50:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:50:04,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:04,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:05,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,197 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-11-28 16:50:05,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:05,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493540530] [2019-11-28 16:50:05,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:05,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 16:50:05,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,662 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493540530] [2019-11-28 16:50:05,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:05,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 16:50:05,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044071679] [2019-11-28 16:50:05,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:50:05,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:50:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:50:05,669 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-11-28 16:50:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:05,693 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-28 16:50:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:50:05,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 16:50:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:05,695 INFO L225 Difference]: With dead ends: 30 [2019-11-28 16:50:05,695 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:05,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:50:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-28 16:50:05,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-11-28 16:50:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:05,702 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-28 16:50:05,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:50:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-28 16:50:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:50:05,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:05,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:05,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,917 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:05,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-11-28 16:50:05,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:05,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474396557] [2019-11-28 16:50:05,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:06,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 16:50:06,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:06,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2019-11-28 16:50:06,339 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:50:06,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:06,343 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:50:06,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:06,346 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:50:06,346 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-28 16:50:06,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,418 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:06,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474396557] [2019-11-28 16:50:06,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:06,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-28 16:50:06,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841186616] [2019-11-28 16:50:06,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:50:06,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:50:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:50:06,503 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-11-28 16:50:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:07,344 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-11-28 16:50:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:07,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 16:50:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:07,348 INFO L225 Difference]: With dead ends: 31 [2019-11-28 16:50:07,348 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:07,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:50:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-28 16:50:07,355 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-11-28 16:50:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:07,356 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-28 16:50:07,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:50:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-28 16:50:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:50:07,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:07,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:07,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-11-28 16:50:07,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:07,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954928160] [2019-11-28 16:50:07,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:07,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 16:50:07,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:08,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-28 16:50:08,055 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:50:08,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:08,059 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:50:08,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:08,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:50:08,078 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:39 [2019-11-28 16:50:08,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:08,631 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:08,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:08,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:09,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2019-11-28 16:50:09,116 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:50:09,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:09,120 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:50:09,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:50:09,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:50:09,129 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:35 [2019-11-28 16:50:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:09,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954928160] [2019-11-28 16:50:09,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:09,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-11-28 16:50:09,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64908788] [2019-11-28 16:50:09,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 16:50:09,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 16:50:09,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:50:09,369 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-11-28 16:50:11,507 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-28 16:50:11,805 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-28 16:50:12,059 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-28 16:50:12,356 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-28 16:50:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:12,357 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-28 16:50:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:50:12,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-28 16:50:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:12,358 INFO L225 Difference]: With dead ends: 27 [2019-11-28 16:50:12,358 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:50:12,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-28 16:50:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:50:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:50:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:50:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:50:12,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-28 16:50:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:12,360 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:50:12,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 16:50:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:50:12,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:50:12,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 16:50:12,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:50:12,969 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-28 16:50:13,269 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-28 16:50:13,726 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-11-28 16:50:14,090 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-28 16:50:14,288 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-28 16:50:14,361 INFO L246 CegarLoopResult]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-11-28 16:50:14,361 INFO L242 CegarLoopResult]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-11-28 16:50:14,361 INFO L246 CegarLoopResult]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-28 16:50:14,361 INFO L242 CegarLoopResult]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)))))) [2019-11-28 16:50:14,361 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:50:14,362 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:50:14,362 INFO L246 CegarLoopResult]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-11-28 16:50:14,362 INFO L242 CegarLoopResult]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-11-28 16:50:14,362 INFO L246 CegarLoopResult]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-28 16:50:14,362 INFO L242 CegarLoopResult]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~x (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))))) [2019-11-28 16:50:14,362 INFO L246 CegarLoopResult]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-28 16:50:14,363 INFO L246 CegarLoopResult]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-11-28 16:50:14,363 INFO L249 CegarLoopResult]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-11-28 16:50:14,363 INFO L246 CegarLoopResult]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-11-28 16:50:14,363 INFO L242 CegarLoopResult]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) [2019-11-28 16:50:14,363 INFO L246 CegarLoopResult]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-11-28 16:50:14,363 INFO L242 CegarLoopResult]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1)))) [2019-11-28 16:50:14,363 INFO L246 CegarLoopResult]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-11-28 16:50:14,364 INFO L242 CegarLoopResult]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) [2019-11-28 16:50:14,364 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-11-28 16:50:14,365 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 28) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) [2019-11-28 16:50:14,365 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-11-28 16:50:14,365 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:50:14,365 INFO L246 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-11-28 16:50:14,365 INFO L242 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-11-28 16:50:14,366 INFO L246 CegarLoopResult]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-11-28 16:50:14,366 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-28 16:50:14,367 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-28 16:50:14,367 INFO L242 CegarLoopResult]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-11-28 16:50:14,367 INFO L246 CegarLoopResult]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-11-28 16:50:14,367 INFO L246 CegarLoopResult]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-11-28 16:50:14,368 INFO L246 CegarLoopResult]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-11-28 16:50:14,368 INFO L246 CegarLoopResult]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-11-28 16:50:14,368 INFO L246 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-28 16:50:14,368 INFO L246 CegarLoopResult]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-11-28 16:50:14,368 INFO L246 CegarLoopResult]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-11-28 16:50:14,368 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-11-28 16:50:14,369 INFO L246 CegarLoopResult]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-11-28 16:50:14,369 INFO L246 CegarLoopResult]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-11-28 16:50:14,369 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-11-28 16:50:14,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:50:14,370 INFO L246 CegarLoopResult]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-11-28 16:50:14,370 INFO L246 CegarLoopResult]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-11-28 16:50:14,370 INFO L246 CegarLoopResult]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-11-28 16:50:14,370 INFO L246 CegarLoopResult]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-11-28 16:50:14,370 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-28 16:50:14,371 INFO L246 CegarLoopResult]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-11-28 16:50:14,371 INFO L246 CegarLoopResult]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-11-28 16:50:14,371 INFO L246 CegarLoopResult]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-11-28 16:50:14,371 INFO L246 CegarLoopResult]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-11-28 16:50:14,371 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-28 16:50:14,372 INFO L242 CegarLoopResult]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~x (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode) (v_skolemized_v_prenex_6_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse4 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))))) [2019-11-28 16:50:14,378 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 16:50:14,392 INFO L168 Benchmark]: Toolchain (without parser) took 13644.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:14,395 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:14,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:14,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:14,398 INFO L168 Benchmark]: Boogie Preprocessor took 50.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:14,399 INFO L168 Benchmark]: RCFGBuilder took 1420.40 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:14,400 INFO L168 Benchmark]: TraceAbstraction took 11671.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:14,407 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.92 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 50.91 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 1420.40 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11671.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.2 MB). Peak memory consumption was 32.9 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...