./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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_1231b.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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ............................................................................................................................................................................................................................................................................................................................................................... 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_1231b.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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:47:20,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:47:20,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:47:20,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:47:20,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:47:20,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:47:20,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:47:20,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:47:20,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:47:20,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:47:20,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:47:20,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:47:20,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:47:20,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:47:20,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:47:20,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:47:20,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:47:20,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:47:20,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:47:20,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:47:20,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:47:20,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:47:20,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:47:20,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:47:20,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:47:20,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:47:20,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:47:20,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:47:20,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:47:20,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:47:20,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:47:20,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:47:20,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:47:20,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:47:20,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:47:20,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:47:20,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:47:20,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:47:20,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:47:20,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:47:20,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:47:20,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:47:20,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:47:20,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:47:20,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:47:20,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:47:20,403 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:47:20,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:47:20,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:47:20,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:47:20,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:47:20,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:47:20,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:47:20,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:47:20,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:47:20,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:47:20,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:47:20,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:47:20,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:47:20,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:47:20,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:47:20,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:47:20,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:47:20,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:20,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:47:20,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:47:20,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:47:20,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:47:20,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:47:20,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:47:20,410 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-11-19 18:47:20,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:47:20,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:47:20,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:47:20,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:47:20,739 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:47:20,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 18:47:20,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129ad9be7/8d2181de41434d50b652d081e763054c/FLAGf0b640dcd [2019-11-19 18:47:21,235 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:47:21,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 18:47:21,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129ad9be7/8d2181de41434d50b652d081e763054c/FLAGf0b640dcd [2019-11-19 18:47:21,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129ad9be7/8d2181de41434d50b652d081e763054c [2019-11-19 18:47:21,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:47:21,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:47:21,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:21,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:47:21,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:47:21,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:21" (1/1) ... [2019-11-19 18:47:21,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af5fd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:21, skipping insertion in model container [2019-11-19 18:47:21,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:21" (1/1) ... [2019-11-19 18:47:21,633 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:47:21,653 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:47:21,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:21,917 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:47:21,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:22,021 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:47:22,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22 WrapperNode [2019-11-19 18:47:22,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:22,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:22,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:47:22,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:47:22,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:22,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:47:22,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:47:22,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:47:22,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (1/1) ... [2019-11-19 18:47:22,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:47:22,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:47:22,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:47:22,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:47:22,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (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-19 18:47:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:47:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 18:47:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:47:22,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:47:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 18:47:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:47:22,577 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:47:22,578 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-19 18:47:22,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:22 BoogieIcfgContainer [2019-11-19 18:47:22,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:47:22,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:47:22,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:47:22,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:47:22,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:21" (1/3) ... [2019-11-19 18:47:22,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a232a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:22, skipping insertion in model container [2019-11-19 18:47:22,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:22" (2/3) ... [2019-11-19 18:47:22,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a232a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:22, skipping insertion in model container [2019-11-19 18:47:22,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:22" (3/3) ... [2019-11-19 18:47:22,588 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2019-11-19 18:47:22,599 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:47:22,608 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:47:22,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:47:22,648 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:47:22,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:47:22,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:47:22,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:47:22,649 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:47:22,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:47:22,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:47:22,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:47:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-19 18:47:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:47:22,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:22,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:22,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-19 18:47:22,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:22,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026064133] [2019-11-19 18:47:22,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:22,878 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-19 18:47:22,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026064133] [2019-11-19 18:47:22,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:22,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:47:22,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191579615] [2019-11-19 18:47:22,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:47:22,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:47:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:47:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:22,904 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-19 18:47:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:22,922 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-19 18:47:22,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:47:22,923 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 18:47:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:22,933 INFO L225 Difference]: With dead ends: 56 [2019-11-19 18:47:22,933 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 18:47:22,937 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-19 18:47:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 18:47:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 18:47:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:47:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-19 18:47:22,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-19 18:47:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:22,974 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-19 18:47:22,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:47:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-19 18:47:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:47:22,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:22,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:22,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-19 18:47:22,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:22,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897648731] [2019-11-19 18:47:22,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:23,073 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-19 18:47:23,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897648731] [2019-11-19 18:47:23,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:23,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:47:23,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685878051] [2019-11-19 18:47:23,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:47:23,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:47:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:47:23,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:47:23,078 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-11-19 18:47:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:23,154 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-19 18:47:23,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:47:23,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 18:47:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:23,156 INFO L225 Difference]: With dead ends: 40 [2019-11-19 18:47:23,156 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 18:47:23,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:47:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 18:47:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-11-19 18:47:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:47:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-19 18:47:23,165 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-19 18:47:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:23,166 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-19 18:47:23,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:47:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-19 18:47:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:47:23,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:23,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:23,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-11-19 18:47:23,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:23,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175828637] [2019-11-19 18:47:23,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:23,249 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-19 18:47:23,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175828637] [2019-11-19 18:47:23,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:23,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:47:23,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470333827] [2019-11-19 18:47:23,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:47:23,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:47:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:47:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:47:23,257 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-11-19 18:47:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:23,326 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-11-19 18:47:23,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:47:23,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-19 18:47:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:23,329 INFO L225 Difference]: With dead ends: 42 [2019-11-19 18:47:23,329 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 18:47:23,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:47:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 18:47:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-11-19 18:47:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:47:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-19 18:47:23,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-11-19 18:47:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:23,343 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-19 18:47:23,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:47:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-19 18:47:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:47:23,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:23,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:23,345 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-19 18:47:23,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:23,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990839234] [2019-11-19 18:47:23,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:47:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:47:23,485 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:47:23,486 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:47:23,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:47:23 BoogieIcfgContainer [2019-11-19 18:47:23,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:47:23,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:47:23,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:47:23,533 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:47:23,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:22" (3/4) ... [2019-11-19 18:47:23,538 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 18:47:23,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:47:23,542 INFO L168 Benchmark]: Toolchain (without parser) took 1925.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -66.0 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:23,542 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:23,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:23,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.31 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-19 18:47:23,545 INFO L168 Benchmark]: Boogie Preprocessor took 38.94 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-19 18:47:23,546 INFO L168 Benchmark]: RCFGBuilder took 467.87 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:23,547 INFO L168 Benchmark]: TraceAbstraction took 951.94 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:23,547 INFO L168 Benchmark]: Witness Printer took 5.86 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-19 18:47:23,552 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.31 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. * Boogie Preprocessor took 38.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 467.87 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 951.94 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.86 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: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; [L16] return x != x; [L62] COND TRUE !isnan_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x [L68] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 20 SDslu, 112 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:47:25,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:47:25,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:47:25,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:47:25,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:47:25,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:47:25,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:47:25,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:47:25,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:47:25,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:47:25,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:47:25,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:47:25,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:47:25,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:47:25,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:47:25,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:47:25,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:47:25,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:47:25,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:47:25,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:47:25,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:47:25,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:47:25,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:47:25,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:47:25,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:47:25,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:47:25,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:47:25,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:47:25,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:47:25,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:47:25,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:47:25,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:47:25,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:47:25,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:47:25,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:47:25,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:47:25,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:47:25,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:47:25,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:47:25,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:47:25,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:47:25,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 18:47:25,545 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:47:25,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:47:25,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:47:25,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:47:25,550 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:47:25,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:47:25,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:47:25,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:47:25,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:47:25,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:47:25,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:47:25,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:47:25,553 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 18:47:25,554 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 18:47:25,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:47:25,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:47:25,555 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:47:25,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:47:25,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:47:25,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:47:25,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:47:25,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:47:25,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:25,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:47:25,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:47:25,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:47:25,558 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 18:47:25,558 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 18:47:25,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:47:25,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 18:47:25,559 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-11-19 18:47:25,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:47:25,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:47:25,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:47:25,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:47:25,887 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:47:25,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 18:47:25,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7441e5d1/4dc2b6e6abbf4e70a9fa96235fd58c72/FLAG2c6c3c274 [2019-11-19 18:47:26,475 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:47:26,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 18:47:26,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7441e5d1/4dc2b6e6abbf4e70a9fa96235fd58c72/FLAG2c6c3c274 [2019-11-19 18:47:26,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7441e5d1/4dc2b6e6abbf4e70a9fa96235fd58c72 [2019-11-19 18:47:26,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:47:26,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:47:26,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:26,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:47:26,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:47:26,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d8ff04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26, skipping insertion in model container [2019-11-19 18:47:26,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:47:26,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:47:27,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:27,155 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:47:27,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:27,291 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:47:27,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27 WrapperNode [2019-11-19 18:47:27,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:27,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:27,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:47:27,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:47:27,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:27,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:47:27,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:47:27,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:47:27,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2019-11-19 18:47:27,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:47:27,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:47:27,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:47:27,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:47:27,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:27,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 18:47:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:47:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 18:47:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:47:27,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:47:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:47:28,009 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:47:28,010 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-19 18:47:28,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:28 BoogieIcfgContainer [2019-11-19 18:47:28,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:47:28,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:47:28,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:47:28,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:47:28,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:26" (1/3) ... [2019-11-19 18:47:28,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26532995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:28, skipping insertion in model container [2019-11-19 18:47:28,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (2/3) ... [2019-11-19 18:47:28,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26532995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:28, skipping insertion in model container [2019-11-19 18:47:28,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:28" (3/3) ... [2019-11-19 18:47:28,018 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2019-11-19 18:47:28,028 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:47:28,035 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:47:28,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:47:28,065 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:47:28,066 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:47:28,066 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:47:28,066 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:47:28,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:47:28,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:47:28,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:47:28,067 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:47:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-19 18:47:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:47:28,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:28,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:28,086 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-19 18:47:28,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:28,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299473332] [2019-11-19 18:47:28,104 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-19 18:47:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:28,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 18:47:28,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:28,218 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-19 18:47:28,219 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:28,222 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-19 18:47:28,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299473332] [2019-11-19 18:47:28,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:28,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 18:47:28,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102177938] [2019-11-19 18:47:28,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:47:28,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:47:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:28,245 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-19 18:47:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:28,264 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-19 18:47:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:47:28,265 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 18:47:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:28,276 INFO L225 Difference]: With dead ends: 56 [2019-11-19 18:47:28,277 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 18:47:28,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 18:47:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 18:47:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:47:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-19 18:47:28,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-19 18:47:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:28,321 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-19 18:47:28,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:47:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-19 18:47:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:47:28,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:28,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:28,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 18:47:28,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-19 18:47:28,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:28,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282150645] [2019-11-19 18:47:28,548 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-19 18:47:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:28,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:47:28,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:28,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-19 18:47:28,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:28,705 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-19 18:47:28,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282150645] [2019-11-19 18:47:28,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:28,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 18:47:28,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462224226] [2019-11-19 18:47:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:47:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:47:28,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:47:28,716 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2019-11-19 18:47:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:28,824 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-19 18:47:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:47:28,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-19 18:47:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:28,828 INFO L225 Difference]: With dead ends: 50 [2019-11-19 18:47:28,828 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 18:47:28,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:47:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 18:47:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2019-11-19 18:47:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:47:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-19 18:47:28,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-19 18:47:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:28,842 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-19 18:47:28,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:47:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-19 18:47:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:47:28,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:28,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:29,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 18:47:29,048 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-19 18:47:29,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:29,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398746062] [2019-11-19 18:47:29,050 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-19 18:47:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:29,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 18:47:29,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:29,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-11-19 18:47:29,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2019-11-19 18:47:29,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:29,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:29,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-19 18:47:29,458 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:29,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:29,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:29,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-19 18:47:29,493 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:29,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:29,507 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:29,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:29,531 INFO L496 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-19 18:47:29,532 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:33 [2019-11-19 18:47:30,626 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) c_ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 c_ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_2_3) .cse1)))) is different from true [2019-11-19 18:47:39,812 WARN L191 SmtUtils]: Spent 9.14 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-19 18:47:42,051 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-11-19 18:47:42,062 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-19 18:47:42,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:44,353 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-11-19 18:47:44,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:44,562 INFO L237 Elim1Store]: Index analysis took 117 ms [2019-11-19 18:47:44,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:44,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 18:47:44,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:44,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 18:47:44,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:44,853 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-19 18:47:44,854 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.8 percent of original size [2019-11-19 18:47:44,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-19 18:47:44,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:44,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:44,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2019-11-19 18:47:44,966 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:44,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:44,988 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:45,130 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-19 18:47:45,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:45,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 18:47:45,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:45,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 18:47:45,330 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:45,443 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-19 18:47:45,443 INFO L567 ElimStorePlain]: treesize reduction 7, result has 92.5 percent of original size [2019-11-19 18:47:45,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-19 18:47:45,475 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:45,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:45,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-11-19 18:47:45,534 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:45,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:45,557 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:45,704 INFO L237 Elim1Store]: Index analysis took 128 ms [2019-11-19 18:47:45,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:45,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 18:47:45,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:45,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 18:47:45,907 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:45,998 INFO L567 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-11-19 18:47:46,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-19 18:47:46,037 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:46,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-19 18:47:46,091 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:46,111 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,270 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-19 18:47:46,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:46,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 18:47:46,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:46,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 18:47:46,455 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,459 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-19 18:47:46,472 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_19 vanished before elimination [2019-11-19 18:47:46,472 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_17 vanished before elimination [2019-11-19 18:47:46,472 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,634 INFO L237 Elim1Store]: Index analysis took 140 ms [2019-11-19 18:47:46,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:46,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 18:47:46,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:46,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 18:47:46,809 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,909 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-11-19 18:47:46,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-19 18:47:46,953 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:46,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-11-19 18:47:47,013 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,033 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,192 INFO L237 Elim1Store]: Index analysis took 128 ms [2019-11-19 18:47:47,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 18:47:47,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 18:47:47,398 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,402 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-19 18:47:47,413 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_25 vanished before elimination [2019-11-19 18:47:47,413 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_27 vanished before elimination [2019-11-19 18:47:47,414 INFO L496 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 18:47:47,681 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 18:47:47,684 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,688 INFO L567 ElimStorePlain]: treesize reduction 104, result has 1.0 percent of original size [2019-11-19 18:47:47,701 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_29 vanished before elimination [2019-11-19 18:47:47,701 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_32 vanished before elimination [2019-11-19 18:47:47,702 INFO L496 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 18:47:47,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 18:47:47,807 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,814 INFO L567 ElimStorePlain]: treesize reduction 102, result has 1.0 percent of original size [2019-11-19 18:47:47,819 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_35 vanished before elimination [2019-11-19 18:47:47,819 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_34 vanished before elimination [2019-11-19 18:47:47,820 INFO L496 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:47:47,948 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-19 18:47:47,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:47,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-11-19 18:47:47,952 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:857, output treesize:137 [2019-11-19 18:47:48,075 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-19 18:47:48,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398746062] [2019-11-19 18:47:48,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:48,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-19 18:47:48,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517111490] [2019-11-19 18:47:48,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 18:47:48,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 18:47:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2019-11-19 18:47:48,085 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 13 states. [2019-11-19 18:47:52,290 WARN L191 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-11-19 18:47:56,445 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-19 18:47:58,834 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 30 [2019-11-19 18:48:03,049 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-19 18:48:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:07,509 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-19 18:48:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:48:07,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-19 18:48:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:07,512 INFO L225 Difference]: With dead ends: 70 [2019-11-19 18:48:07,512 INFO L226 Difference]: Without dead ends: 54 [2019-11-19 18:48:07,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=140, Invalid=323, Unknown=3, NotChecked=40, Total=506 [2019-11-19 18:48:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-19 18:48:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 26. [2019-11-19 18:48:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:48:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-19 18:48:07,523 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-11-19 18:48:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:07,523 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-19 18:48:07,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 18:48:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-19 18:48:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:48:07,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:07,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:48:07,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 18:48:07,744 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2019-11-19 18:48:07,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:07,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211501025] [2019-11-19 18:48:07,746 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-19 18:48:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:07,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:48:07,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:07,869 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-19 18:48:07,869 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:07,890 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-19 18:48:07,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211501025] [2019-11-19 18:48:07,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:07,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 18:48:07,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627598882] [2019-11-19 18:48:07,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:48:07,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:48:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:48:07,894 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 6 states. [2019-11-19 18:48:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:08,021 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-19 18:48:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:48:08,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-19 18:48:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:08,023 INFO L225 Difference]: With dead ends: 48 [2019-11-19 18:48:08,023 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 18:48:08,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:48:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 18:48:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2019-11-19 18:48:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:48:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-19 18:48:08,033 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-11-19 18:48:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:08,034 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-19 18:48:08,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:48:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-19 18:48:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 18:48:08,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:08,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:48:08,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 18:48:08,249 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2019-11-19 18:48:08,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:08,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743925915] [2019-11-19 18:48:08,251 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-19 18:48:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:08,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 18:48:08,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:08,367 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-19 18:48:08,367 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:08,637 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-19 18:48:08,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743925915] [2019-11-19 18:48:08,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:08,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 18:48:08,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918967298] [2019-11-19 18:48:08,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:48:08,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:48:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:48:08,639 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2019-11-19 18:48:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:08,670 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-19 18:48:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:48:08,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-19 18:48:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:08,673 INFO L225 Difference]: With dead ends: 33 [2019-11-19 18:48:08,673 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 18:48:08,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:48:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 18:48:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-19 18:48:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:48:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 18:48:08,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-11-19 18:48:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:08,680 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 18:48:08,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:48:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-19 18:48:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 18:48:08,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:08,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:48:08,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 18:48:08,882 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2019-11-19 18:48:08,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:08,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757961225] [2019-11-19 18:48:08,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-19 18:48:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:09,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 18:48:09,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:09,093 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-19 18:48:09,094 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:09,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:48:09,330 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-19 18:48:09,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757961225] [2019-11-19 18:48:09,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:09,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 18:48:09,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196066227] [2019-11-19 18:48:09,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:48:09,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:48:09,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:48:09,332 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2019-11-19 18:48:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:09,672 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-11-19 18:48:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:48:09,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-19 18:48:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:09,674 INFO L225 Difference]: With dead ends: 40 [2019-11-19 18:48:09,674 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:48:09,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-19 18:48:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:48:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-19 18:48:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:48:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-19 18:48:09,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-19 18:48:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:09,682 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-19 18:48:09,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:48:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-19 18:48:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 18:48:09,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:09,683 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-19 18:48:09,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 18:48:09,905 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2019-11-19 18:48:09,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:09,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613776001] [2019-11-19 18:48:09,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-19 18:48:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:10,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 18:48:10,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:10,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:48:10,375 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-19 18:48:10,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:10,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:48:10,723 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-19 18:48:10,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613776001] [2019-11-19 18:48:10,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:10,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-19 18:48:10,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137833816] [2019-11-19 18:48:10,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:48:10,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:48:10,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:48:10,726 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2019-11-19 18:48:11,303 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-19 18:48:15,659 WARN L191 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-11-19 18:48:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:15,939 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-11-19 18:48:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:48:15,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-19 18:48:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:15,941 INFO L225 Difference]: With dead ends: 70 [2019-11-19 18:48:15,941 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 18:48:15,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-19 18:48:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 18:48:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-19 18:48:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:48:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-19 18:48:15,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-11-19 18:48:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:15,961 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-19 18:48:15,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:48:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-19 18:48:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:48:15,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:15,963 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-19 18:48:16,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 18:48:16,177 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2019-11-19 18:48:16,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:16,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933171586] [2019-11-19 18:48:16,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-19 18:48:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:16,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 18:48:16,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:16,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-19 18:48:16,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-19 18:48:16,380 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-19 18:48:16,421 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-19 18:48:16,450 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,464 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,484 INFO L496 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-19 18:48:16,484 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:30 [2019-11-19 18:48:16,520 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-19 18:48:16,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:16,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:48:16,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-19 18:48:16,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-19 18:48:16,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-19 18:48:16,726 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-19 18:48:16,775 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,791 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-19 18:48:16,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-19 18:48:16,871 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-19 18:48:16,920 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2019-11-19 18:48:16,953 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-19 18:48:16,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:16,969 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:48:17,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:48:17,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 18:48:17,013 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:69 [2019-11-19 18:48:17,232 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-19 18:48:17,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933171586] [2019-11-19 18:48:17,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:17,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 18:48:17,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070212736] [2019-11-19 18:48:17,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:48:17,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:48:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:48:17,235 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2019-11-19 18:48:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:17,840 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-19 18:48:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:48:17,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-19 18:48:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:17,842 INFO L225 Difference]: With dead ends: 44 [2019-11-19 18:48:17,842 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 18:48:17,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-19 18:48:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 18:48:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 18:48:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:48:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-11-19 18:48:17,852 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2019-11-19 18:48:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:17,853 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-19 18:48:17,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:48:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-11-19 18:48:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:48:17,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:17,854 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-19 18:48:18,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-19 18:48:18,057 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2019-11-19 18:48:18,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:18,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037159839] [2019-11-19 18:48:18,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-19 18:48:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:18,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:48:18,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:18,216 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-19 18:48:18,216 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:18,218 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-19 18:48:18,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037159839] [2019-11-19 18:48:18,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:18,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-19 18:48:18,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620950393] [2019-11-19 18:48:18,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:48:18,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:48:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:48:18,220 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2019-11-19 18:48:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:18,268 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-19 18:48:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:48:18,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-19 18:48:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:18,269 INFO L225 Difference]: With dead ends: 40 [2019-11-19 18:48:18,269 INFO L226 Difference]: Without dead ends: 24 [2019-11-19 18:48:18,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:48:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-19 18:48:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-19 18:48:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-19 18:48:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-11-19 18:48:18,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2019-11-19 18:48:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:18,276 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-11-19 18:48:18,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:48:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-11-19 18:48:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 18:48:18,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:48:18,277 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] [2019-11-19 18:48:18,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-19 18:48:18,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:48:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:48:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2019-11-19 18:48:18,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:48:18,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776528876] [2019-11-19 18:48:18,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-19 18:48:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:48:18,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 18:48:18,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:48:18,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:48:18,878 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-19 18:48:19,035 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-19 18:48:19,115 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-19 18:48:19,116 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:48:19,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:48:19,576 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-19 18:48:19,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776528876] [2019-11-19 18:48:19,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:48:19,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-19 18:48:19,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381076978] [2019-11-19 18:48:19,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 18:48:19,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:48:19,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 18:48:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-19 18:48:19,579 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 16 states. [2019-11-19 18:48:20,172 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-19 18:48:20,569 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-19 18:48:20,889 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-19 18:48:21,176 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-19 18:48:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:48:21,177 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-19 18:48:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 18:48:21,177 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-19 18:48:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:48:21,178 INFO L225 Difference]: With dead ends: 24 [2019-11-19 18:48:21,178 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:48:21,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-19 18:48:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:48:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:48:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:48:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:48:21,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-19 18:48:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:48:21,180 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:48:21,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 18:48:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:48:21,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:48:21,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-19 18:48:21,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:48:21,645 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 184 [2019-11-19 18:48:22,352 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 29 [2019-11-19 18:48:23,056 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 38 [2019-11-19 18:48:23,220 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 17 [2019-11-19 18:48:27,933 WARN L191 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 176 DAG size of output: 48 [2019-11-19 18:48:27,935 INFO L447 ceAbstractionStarter]: At program point L73(lines 53 74) the Hoare annotation is: true [2019-11-19 18:48:27,936 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 18:48:27,936 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:48:27,936 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:48:27,936 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-19 18:48:27,936 INFO L444 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-19 18:48:27,936 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y .cse0) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-19 18:48:27,936 INFO L444 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2019-11-19 18:48:27,936 INFO L440 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) .cse0)))) [2019-11-19 18:48:27,937 INFO L444 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2019-11-19 18:48:27,937 INFO L440 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-19 18:48:27,937 INFO L444 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2019-11-19 18:48:27,937 INFO L444 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2019-11-19 18:48:27,937 INFO L440 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 .cse0) (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) ULTIMATE.start_fmin_double_~x) (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start___fpclassify_double_~msw~0))) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (or (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)) (and (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32)) (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32))) (= (_ bv0 32) ULTIMATE.start___fpclassify_double_~lsw~0)) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-19 18:48:27,937 INFO L440 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_skolemized_v_prenex_3_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_7|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_3_3) ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) .cse1)))) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2019-11-19 18:48:27,937 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-19 18:48:27,937 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2019-11-19 18:48:27,937 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L62-2(lines 62 71) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L440 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq |ULTIMATE.start_fmin_double_#res| ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))))) [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 70) no Hoare annotation was computed. [2019-11-19 18:48:27,938 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-19 18:48:27,939 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2019-11-19 18:48:27,939 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2019-11-19 18:48:27,939 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-19 18:48:27,947 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,949 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,953 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,954 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,954 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:27,955 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,959 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,959 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,962 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,963 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:27,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:27,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,965 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,965 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,966 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,967 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:27,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:27,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:27,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,972 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,974 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:27,977 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:27,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:48:27 BoogieIcfgContainer [2019-11-19 18:48:27,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:48:27,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:48:27,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:48:27,980 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:48:27,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:28" (3/4) ... [2019-11-19 18:48:27,985 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:48:27,999 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-19 18:48:27,999 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 18:48:28,000 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 18:48:28,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) [2019-11-19 18:48:28,028 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x) [2019-11-19 18:48:28,029 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_2_4 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) == x && v_skolemized_v_prenex_2_4[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && !(0bv32 == \result)) && 0bv32 == \result) && x == x) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-19 18:48:28,029 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2019-11-19 18:48:28,029 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-19 18:48:28,030 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result [2019-11-19 18:48:28,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:48:28,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:48:28,062 INFO L168 Benchmark]: Toolchain (without parser) took 61211.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 247.5 MB). Free memory was 955.0 MB in the beginning and 883.5 MB in the end (delta: 71.5 MB). Peak memory consumption was 318.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:48:28,062 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:48:28,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:48:28,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:48:28,064 INFO L168 Benchmark]: Boogie Preprocessor took 35.81 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-19 18:48:28,064 INFO L168 Benchmark]: RCFGBuilder took 630.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:48:28,065 INFO L168 Benchmark]: TraceAbstraction took 59967.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 212.7 MB). Peak memory consumption was 327.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:48:28,065 INFO L168 Benchmark]: Witness Printer took 80.47 ms. Allocated memory is still 1.3 GB. Free memory is still 883.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:48:28,068 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 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 630.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59967.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 212.7 MB). Peak memory consumption was 327.5 MB. Max. memory is 11.5 GB. * Witness Printer took 80.47 ms. Allocated memory is still 1.3 GB. Free memory is still 883.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: 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 - InvariantResult [Line: 44]: Loop Invariant [2019-11-19 18:48:28,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 18:48:28,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 16]: Loop Invariant [2019-11-19 18:48:28,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 20]: Loop Invariant [2019-11-19 18:48:28,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x) - InvariantResult [Line: 17]: Loop Invariant [2019-11-19 18:48:28,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:28,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:28,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:28,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 18:48:28,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:48:28,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result - InvariantResult [Line: 20]: Loop Invariant [2019-11-19 18:48:28,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2019-11-19 18:48:28,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:48:28,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 18:48:28,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_2_4 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) == x && v_skolemized_v_prenex_2_4[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && !(0bv32 == \result)) && 0bv32 == \result) && x == x) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 59.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.5s, HoareTripleCheckerStatistics: 268 SDtfs, 696 SDslu, 493 SDs, 0 SdLazy, 359 SolverSat, 52 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 37.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, 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, 10 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 248 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1097 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12268 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 74 QuantifiedInterpolants, 70858 SizeOfPredicates, 62 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 proved your program to be correct! Received shutdown request...