/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.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 69b156b7cb8e47e9e9902f33725c5b7467b2d17a ...................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.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 69b156b7cb8e47e9e9902f33725c5b7467b2d17a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:02:34,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:02:34,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:02:34,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:02:34,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:02:34,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:02:34,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:02:34,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:02:34,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:02:34,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:02:34,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:02:34,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:02:34,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:02:34,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:02:34,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:02:34,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:02:34,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:02:34,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:02:34,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:02:34,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:02:34,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:02:34,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:02:34,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:02:34,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:02:34,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:02:34,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:02:34,894 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:02:34,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:02:34,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:02:34,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:02:34,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:02:34,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:02:34,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:02:34,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:02:34,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:02:34,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:02:34,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:02:34,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:02:34,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:02:34,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:02:34,940 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:02:34,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:02:34,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:02:34,941 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:02:34,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:02:34,942 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:02:34,943 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:02:34,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:02:34,943 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:02:34,943 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:02:34,943 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:02:34,944 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:02:34,944 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:02:34,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:02:34,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:02:34,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:02:34,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:02:34,945 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:02:34,945 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:02:34,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:02:34,945 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 69b156b7cb8e47e9e9902f33725c5b7467b2d17a [2018-09-20 15:02:34,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:02:35,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:02:35,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:02:35,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:02:35,021 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:02:35,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-09-20 15:02:35,380 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb90b78e/d6046378304244cbb75d054dbe5ef96c/FLAG9e6a18d6b [2018-09-20 15:02:35,624 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:02:35,625 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-09-20 15:02:35,638 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb90b78e/d6046378304244cbb75d054dbe5ef96c/FLAG9e6a18d6b [2018-09-20 15:02:35,666 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb90b78e/d6046378304244cbb75d054dbe5ef96c [2018-09-20 15:02:35,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:02:35,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:02:35,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:02:35,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:02:35,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:02:35,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:02:35" (1/1) ... [2018-09-20 15:02:35,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7542de0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:35, skipping insertion in model container [2018-09-20 15:02:35,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:02:35" (1/1) ... [2018-09-20 15:02:35,707 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:02:36,015 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:02:36,038 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:02:36,091 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:02:36,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36 WrapperNode [2018-09-20 15:02:36,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:02:36,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:02:36,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:02:36,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:02:36,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (1/1) ... [2018-09-20 15:02:36,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:02:36,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:02:36,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:02:36,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:02:36,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (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 [2018-09-20 15:02:36,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:02:36,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:02:36,403 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-09-20 15:02:36,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:02:36,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:02:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:02:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-09-20 15:02:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:02:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:02:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:02:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:02:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:02:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:02:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:02:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:02:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:02:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:02:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:02:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:02:37,201 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:02:37,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:02:37 BoogieIcfgContainer [2018-09-20 15:02:37,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:02:37,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:02:37,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:02:37,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:02:37,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:02:35" (1/3) ... [2018-09-20 15:02:37,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9e5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:02:37, skipping insertion in model container [2018-09-20 15:02:37,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:36" (2/3) ... [2018-09-20 15:02:37,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9e5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:02:37, skipping insertion in model container [2018-09-20 15:02:37,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:02:37" (3/3) ... [2018-09-20 15:02:37,211 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c_true-unreach-call.c [2018-09-20 15:02:37,222 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:02:37,231 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:02:37,284 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:02:37,285 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:02:37,285 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:02:37,285 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:02:37,285 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:02:37,285 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:02:37,285 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:02:37,286 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:02:37,286 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:02:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-09-20 15:02:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 15:02:37,317 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:02:37,319 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:02:37,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:02:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1646053515, now seen corresponding path program 1 times [2018-09-20 15:02:37,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:02:37,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:02:37,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:02:37,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:02:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:02:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:02:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:02:37,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:02:37,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:02:37,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:02:37,492 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:02:37,493 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:02:37,495 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-09-20 15:02:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:02:37,529 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2018-09-20 15:02:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:02:37,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 15:02:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:02:37,543 INFO L225 Difference]: With dead ends: 154 [2018-09-20 15:02:37,544 INFO L226 Difference]: Without dead ends: 77 [2018-09-20 15:02:37,548 INFO L606 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 [2018-09-20 15:02:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-20 15:02:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-20 15:02:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-20 15:02:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-09-20 15:02:37,600 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 19 [2018-09-20 15:02:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:02:37,600 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-09-20 15:02:37,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:02:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-09-20 15:02:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 15:02:37,602 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:02:37,603 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:02:37,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:02:37,604 INFO L82 PathProgramCache]: Analyzing trace with hash -414785187, now seen corresponding path program 1 times [2018-09-20 15:02:37,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:02:37,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:02:37,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:02:37,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:02:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:02:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:02:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:02:37,756 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:02:37,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:02:37 BoogieIcfgContainer [2018-09-20 15:02:37,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:02:37,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:02:37,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:02:37,800 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:02:37,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:02:37" (3/4) ... [2018-09-20 15:02:37,807 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:02:37,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:02:37,808 INFO L168 Benchmark]: Toolchain (without parser) took 2135.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 951.9 MB in the beginning and 1.0 GB in the end (delta: -75.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:02:37,810 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:02:37,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.72 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:02:37,812 INFO L168 Benchmark]: Boogie Preprocessor took 56.51 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:02:37,813 INFO L168 Benchmark]: RCFGBuilder took 1000.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:02:37,815 INFO L168 Benchmark]: TraceAbstraction took 595.68 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:02:37,815 INFO L168 Benchmark]: Witness Printer took 6.97 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. [2018-09-20 15:02:37,821 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.72 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.51 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1000.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 595.68 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.97 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: 103]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 98, overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L14] static const double huge_floor = 1.0e300; VAL [\old(huge_floor)=6442450948, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L98] double x = -0.0; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L99] CALL, EXPR floor_double(x) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450952] [L20] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=6442450952, ew_u={6442450949:0}, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450952] [L21] FCALL ew_u.value = (x) VAL [\old(x)=6442450952, ew_u={6442450949:0}, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450952] [L22] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=6442450952, ew_u={6442450949:0}, ew_u.parts.msw=3, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450952] [L22] (i0) = ew_u.parts.msw VAL [\old(x)=6442450952, ew_u={6442450949:0}, ew_u.parts.msw=3, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, x=6442450952] [L22] FCALL (i0) = ew_u.parts.msw VAL [(i0) = ew_u.parts.msw=6442450951, \old(x)=6442450952, ew_u={6442450949:0}, ew_u.parts.msw=3, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, x=6442450952] [L23] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=6442450952, ew_u={6442450949:0}, ew_u.parts.lsw=6442450944, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, x=6442450952] [L23] (i1) = ew_u.parts.lsw VAL [\old(x)=6442450952, ew_u={6442450949:0}, ew_u.parts.lsw=6442450944, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, x=6442450952] [L23] FCALL (i1) = ew_u.parts.lsw VAL [(i1) = ew_u.parts.lsw=6442450947, \old(x)=6442450952, ew_u={6442450949:0}, ew_u.parts.lsw=6442450944, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, x=6442450952] [L24] COND FALSE !(0) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, x=6442450952] [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, x=6442450952] [L26] COND FALSE !(j0 < 20) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, j0=1024, x=6442450952] [L47] COND TRUE j0 > 51 VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, j0=1024, x=6442450952] [L48] COND TRUE j0 == 0x400 [L49] RET return x + x; VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=-2147483648, j0=1024, x=6442450952] [L99] EXPR floor_double(x) VAL [floor_double(x)=6442450946, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450952] [L99] double res = floor_double(x); [L102] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450946, res == -0.0 && __signbit_double(res) == 1=0, x=6442450952] [L102] COND FALSE, EXPR !(res == -0.0 && __signbit_double(res) == 1) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450946, res == -0.0 && __signbit_double(res) == 1=0, x=6442450952] [L102] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L103] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450946, x=6442450952] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 81 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-40ef509 [2018-09-20 15:02:40,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:02:40,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:02:40,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:02:40,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:02:40,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:02:40,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:02:40,207 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:02:40,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:02:40,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:02:40,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:02:40,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:02:40,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:02:40,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:02:40,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:02:40,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:02:40,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:02:40,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:02:40,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:02:40,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:02:40,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:02:40,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:02:40,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:02:40,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:02:40,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:02:40,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:02:40,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:02:40,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:02:40,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:02:40,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:02:40,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:02:40,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:02:40,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:02:40,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:02:40,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:02:40,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:02:40,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:02:40,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:02:40,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:02:40,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:02:40,272 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:02:40,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:02:40,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:02:40,273 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:02:40,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:02:40,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:02:40,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:02:40,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:02:40,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:02:40,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:02:40,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:02:40,275 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:02:40,275 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:02:40,275 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:02:40,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:02:40,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:02:40,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:02:40,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:02:40,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:02:40,277 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:02:40,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:02:40,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:02:40,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:02:40,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:02:40,279 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:02:40,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:02:40,279 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:02:40,279 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:02:40,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 69b156b7cb8e47e9e9902f33725c5b7467b2d17a [2018-09-20 15:02:40,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:02:40,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:02:40,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:02:40,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:02:40,362 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:02:40,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-09-20 15:02:40,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee892b47/cc6f50bd8e514c5994af9ec55e6c7c37/FLAGdf95d9558 [2018-09-20 15:02:40,890 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:02:40,891 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-09-20 15:02:40,901 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee892b47/cc6f50bd8e514c5994af9ec55e6c7c37/FLAGdf95d9558 [2018-09-20 15:02:40,919 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee892b47/cc6f50bd8e514c5994af9ec55e6c7c37 [2018-09-20 15:02:40,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:02:40,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:02:40,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:02:40,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:02:40,937 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:02:40,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:02:40" (1/1) ... [2018-09-20 15:02:40,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35eb723e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:40, skipping insertion in model container [2018-09-20 15:02:40,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:02:40" (1/1) ... [2018-09-20 15:02:40,955 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:02:41,242 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:02:41,263 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:02:41,322 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:02:41,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41 WrapperNode [2018-09-20 15:02:41,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:02:41,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:02:41,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:02:41,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:02:41,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (1/1) ... [2018-09-20 15:02:41,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:02:41,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:02:41,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:02:41,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:02:41,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (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 [2018-09-20 15:02:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:02:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:02:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-09-20 15:02:41,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:02:41,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:02:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:02:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-09-20 15:02:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:02:41,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:02:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:02:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:02:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:02:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:02:41,877 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:02:41,939 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:02:42,628 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:02:42,648 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:02:42,666 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:02:43,961 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:02:43,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:02:43 BoogieIcfgContainer [2018-09-20 15:02:43,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:02:43,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:02:43,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:02:43,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:02:43,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:02:40" (1/3) ... [2018-09-20 15:02:43,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9de468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:02:43, skipping insertion in model container [2018-09-20 15:02:43,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:02:41" (2/3) ... [2018-09-20 15:02:43,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9de468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:02:43, skipping insertion in model container [2018-09-20 15:02:43,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:02:43" (3/3) ... [2018-09-20 15:02:43,972 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c_true-unreach-call.c [2018-09-20 15:02:43,983 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:02:43,993 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:02:44,039 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:02:44,040 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:02:44,040 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:02:44,041 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:02:44,041 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:02:44,041 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:02:44,041 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:02:44,041 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:02:44,041 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:02:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-09-20 15:02:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 15:02:44,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:02:44,073 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:02:44,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:02:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1646053515, now seen corresponding path program 1 times [2018-09-20 15:02:44,087 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:02:44,087 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:02:44,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:02:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:02:44,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:02:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:02:44,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:02:44,239 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:02:44,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:02:44,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:02:44,259 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:02:44,260 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:02:44,262 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-09-20 15:02:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:02:44,295 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2018-09-20 15:02:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:02:44,296 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 15:02:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:02:44,308 INFO L225 Difference]: With dead ends: 154 [2018-09-20 15:02:44,308 INFO L226 Difference]: Without dead ends: 77 [2018-09-20 15:02:44,312 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:02:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-20 15:02:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-20 15:02:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-20 15:02:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-09-20 15:02:44,359 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 19 [2018-09-20 15:02:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:02:44,360 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-09-20 15:02:44,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:02:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-09-20 15:02:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 15:02:44,362 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:02:44,362 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:02:44,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:02:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash -414785187, now seen corresponding path program 1 times [2018-09-20 15:02:44,363 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:02:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2018-09-20 15:02:44,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:02:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:02:44,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:02:44,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:02:44,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:02:44,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:02:44,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:02:44,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:02:44,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:02:44,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:02:44,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:02:44,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:02:44,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:02:44,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:02:44,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:02:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:02:45,357 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:02:45,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:02:45,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:02:45,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:02:45,374 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:02:45,375 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:02:45,375 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 9 states. [2018-09-20 15:02:46,341 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:02:46,854 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 15:02:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:02:52,973 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-09-20 15:02:52,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-20 15:02:52,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-09-20 15:02:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:02:52,979 INFO L225 Difference]: With dead ends: 150 [2018-09-20 15:02:52,979 INFO L226 Difference]: Without dead ends: 86 [2018-09-20 15:02:52,983 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:02:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-20 15:02:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-09-20 15:02:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-20 15:02:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-09-20 15:02:52,995 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 32 [2018-09-20 15:02:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:02:52,995 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-09-20 15:02:52,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:02:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-09-20 15:02:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 15:02:52,997 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:02:52,997 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:02:52,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:02:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1355929740, now seen corresponding path program 1 times [2018-09-20 15:02:52,998 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:02:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:02:53,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:02:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:02:53,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:02:53,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:02:53,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:02:53,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:02:53,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:02:53,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:02:53,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:02:53,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:02:53,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:02:53,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:02:53,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:02:53,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:02:53,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:02:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:02:53,539 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:02:53,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:02:53,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:02:53,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:02:53,552 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:02:53,552 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:02:53,553 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 9 states. [2018-09-20 15:02:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:02:58,807 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-09-20 15:02:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-20 15:02:58,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-09-20 15:02:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:02:58,811 INFO L225 Difference]: With dead ends: 137 [2018-09-20 15:02:58,811 INFO L226 Difference]: Without dead ends: 79 [2018-09-20 15:02:58,812 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:02:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-20 15:02:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-09-20 15:02:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:02:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-09-20 15:02:58,819 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 32 [2018-09-20 15:02:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:02:58,820 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-09-20 15:02:58,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:02:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-09-20 15:02:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-20 15:02:58,822 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:02:58,823 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:02:58,823 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:02:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1719063233, now seen corresponding path program 1 times [2018-09-20 15:02:58,825 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:02:58,825 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:02:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:02:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:02:58,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:02,208 WARN L178 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-20 15:03:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:02,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:02,245 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:02,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-20 15:03:02,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-20 15:03:02,246 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-20 15:03:02,246 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-20 15:03:02,246 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2018-09-20 15:03:07,151 WARN L178 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 15:03:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:08,403 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-09-20 15:03:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-20 15:03:08,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-09-20 15:03:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:08,418 INFO L225 Difference]: With dead ends: 100 [2018-09-20 15:03:08,418 INFO L226 Difference]: Without dead ends: 64 [2018-09-20 15:03:08,419 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-20 15:03:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-20 15:03:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-20 15:03:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:03:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-09-20 15:03:08,427 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 45 [2018-09-20 15:03:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:08,427 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-09-20 15:03:08,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-20 15:03:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-09-20 15:03:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-20 15:03:08,430 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:08,430 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:08,430 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1060697608, now seen corresponding path program 1 times [2018-09-20 15:03:08,431 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:08,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:03:08,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:08,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:08,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:03:08,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:08,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:08,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:08,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:08,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:08,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:08,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:08,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:08,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:08,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:08,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:08,890 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:08,908 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:08,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:03:08,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:03:08,909 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:03:08,909 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:03:08,909 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 8 states. [2018-09-20 15:03:09,390 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-20 15:03:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:11,095 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-20 15:03:11,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:03:11,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-09-20 15:03:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:11,100 INFO L225 Difference]: With dead ends: 115 [2018-09-20 15:03:11,100 INFO L226 Difference]: Without dead ends: 79 [2018-09-20 15:03:11,101 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:03:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-20 15:03:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-09-20 15:03:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:03:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-09-20 15:03:11,109 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 46 [2018-09-20 15:03:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:11,110 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-09-20 15:03:11,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:03:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-09-20 15:03:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-20 15:03:11,112 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:11,112 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:11,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1042625013, now seen corresponding path program 1 times [2018-09-20 15:03:11,114 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:03:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:11,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:11,348 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:03:11,348 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:03:11,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:03:11,366 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:11,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:03:11,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:11,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:11,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:11,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:03:11,612 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:03:11,613 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:03:11,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-20 15:03:11,655 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:11,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:03:11,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:11,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:11,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:11,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:03:11,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-20 15:03:11,897 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:11,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:03:11,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:12,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:12,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:12,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:03:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:12,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:12,739 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:12,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:03:12,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:03:12,740 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:03:12,740 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:03:12,740 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 10 states. [2018-09-20 15:03:13,239 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:03:13,882 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 15:03:14,243 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:03:15,032 WARN L178 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-20 15:03:15,222 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-20 15:03:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:16,240 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-09-20 15:03:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:03:16,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-09-20 15:03:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:16,243 INFO L225 Difference]: With dead ends: 100 [2018-09-20 15:03:16,243 INFO L226 Difference]: Without dead ends: 64 [2018-09-20 15:03:16,244 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:03:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-20 15:03:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-20 15:03:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:03:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-20 15:03:16,257 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 47 [2018-09-20 15:03:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:16,257 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-20 15:03:16,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:03:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-20 15:03:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-20 15:03:16,262 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:16,262 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:16,263 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1860273463, now seen corresponding path program 1 times [2018-09-20 15:03:16,263 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2018-09-20 15:03:16,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:03:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:16,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:16,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:03:16,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:16,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:16,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:16,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:16,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:16,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:16,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:16,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:03:16,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:16,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:16,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-20 15:03:17,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-20 15:03:17,026 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:17,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-09-20 15:03:17,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:17,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-09-20 15:03:17,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-09-20 15:03:17,199 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:17,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2018-09-20 15:03:17,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:17,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:17,272 INFO L267 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. [2018-09-20 15:03:17,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:36 [2018-09-20 15:03:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:18,027 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:18,048 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:18,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-20 15:03:18,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-20 15:03:18,049 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-20 15:03:18,049 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-20 15:03:18,052 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-09-20 15:03:18,923 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:03:21,175 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-09-20 15:03:21,764 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-09-20 15:03:22,132 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-09-20 15:03:22,481 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-09-20 15:03:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:23,506 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2018-09-20 15:03:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:03:23,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-09-20 15:03:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:23,509 INFO L225 Difference]: With dead ends: 67 [2018-09-20 15:03:23,510 INFO L226 Difference]: Without dead ends: 64 [2018-09-20 15:03:23,511 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2018-09-20 15:03:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-20 15:03:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-20 15:03:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:03:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2018-09-20 15:03:23,518 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 47 [2018-09-20 15:03:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:23,519 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2018-09-20 15:03:23,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-20 15:03:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2018-09-20 15:03:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:03:23,521 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:23,521 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:23,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash -723670816, now seen corresponding path program 1 times [2018-09-20 15:03:23,523 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:03:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:23,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:23,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:03:23,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:23,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:23,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:23,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:23,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:23,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:23,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:23,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:23,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:23,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:23,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:24,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:03:24,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:24,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:24,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:24,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:24,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:24,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-20 15:03:24,260 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:24,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-09-20 15:03:24,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:24,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:24,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:24,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-09-20 15:03:24,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-09-20 15:03:24,322 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:24,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2018-09-20 15:03:24,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:24,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:24,353 INFO L267 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. [2018-09-20 15:03:24,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:28 [2018-09-20 15:03:27,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:03:27,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:27,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:27,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:27,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:27,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:27,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:27,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:27,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:27,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:27,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:27,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:27,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:27,890 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:27,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-20 15:03:27,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-20 15:03:27,891 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-20 15:03:27,892 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=342, Unknown=1, NotChecked=0, Total=380 [2018-09-20 15:03:27,892 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand 20 states. [2018-09-20 15:03:36,312 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:03:38,694 WARN L178 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:03:41,000 WARN L178 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:03:43,311 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:03:45,810 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:03:49,593 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:03:52,054 WARN L178 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:03:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:56,171 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-09-20 15:03:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-20 15:03:56,173 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-09-20 15:03:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:56,173 INFO L225 Difference]: With dead ends: 64 [2018-09-20 15:03:56,173 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:03:56,175 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=179, Invalid=1460, Unknown=1, NotChecked=0, Total=1640 [2018-09-20 15:03:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:03:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:03:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:03:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:03:56,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-09-20 15:03:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:56,176 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:03:56,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-20 15:03:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:03:56,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:03:56,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:03:56,442 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-20 15:03:56,602 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-20 15:03:56,739 INFO L426 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-09-20 15:03:56,739 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L422 ceAbstractionStarter]: At program point L19-3(lines 19 24) the Hoare annotation is: (or (= floor_double_~x |floor_double_#in~x|) (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point L19-4(lines 19 24) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point floor_doubleFINAL(lines 16 77) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point L28(lines 28 35) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L426 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-09-20 15:03:56,740 INFO L429 ceAbstractionStarter]: At program point floor_doubleENTRY(lines 16 77) the Hoare annotation is: true [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L70(lines 70 75) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L70-2(lines 16 77) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L70-3(lines 70 75) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 63) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 34) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L62-2(lines 62 63) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-09-20 15:03:56,741 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L71-1(line 71) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L71-2(line 71) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L71-3(line 71) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 69) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 34) no Hoare annotation was computed. [2018-09-20 15:03:56,742 INFO L426 ceAbstractionStarter]: For program point L56(lines 56 68) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L48(lines 48 51) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L40(lines 40 45) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L57(lines 57 66) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 57 66) no Hoare annotation was computed. [2018-09-20 15:03:56,743 INFO L426 ceAbstractionStarter]: For program point floor_doubleEXIT(lines 16 77) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L41-2(lines 41 42) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L74-3(line 74) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 65) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point L26(lines 26 69) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:03:56,744 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 79 89) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 79 89) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L85-1(line 85) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L85-2(line 85) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L83-1(line 83) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L83-2(line 83) no Hoare annotation was computed. [2018-09-20 15:03:56,745 INFO L426 ceAbstractionStarter]: For program point L82-1(lines 82 86) no Hoare annotation was computed. [2018-09-20 15:03:56,746 INFO L426 ceAbstractionStarter]: For program point L83-3(line 83) no Hoare annotation was computed. [2018-09-20 15:03:56,746 INFO L422 ceAbstractionStarter]: At program point L82-3(lines 82 86) the Hoare annotation is: (or (= |__signbit_double_#in~x| __signbit_double_~x) (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-09-20 15:03:56,746 INFO L426 ceAbstractionStarter]: For program point L82-4(lines 82 86) no Hoare annotation was computed. [2018-09-20 15:03:56,746 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 79 89) the Hoare annotation is: true [2018-09-20 15:03:56,746 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:03:56,746 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) [2018-09-20 15:03:56,746 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:03:56,746 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:03:56,746 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 91 108) the Hoare annotation is: true [2018-09-20 15:03:56,747 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 91 108) no Hoare annotation was computed. [2018-09-20 15:03:56,747 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 91 108) no Hoare annotation was computed. [2018-09-20 15:03:56,747 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-20 15:03:56,747 INFO L426 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-09-20 15:03:56,747 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2018-09-20 15:03:56,747 INFO L422 ceAbstractionStarter]: At program point L102-1(line 102) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0)) (and (exists ((v_arrayElimCell_21 (_ BitVec 32)) (|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|)) (fp.neg (_ +zero 11 53))) (= (let ((.cse0 (concat ((_ extract 63 32) |v_q#valueAsBitvector_12|) v_arrayElimCell_21))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) |main_#t~short10| (= main_~x~0 (fp.neg (_ +zero 11 53))))) [2018-09-20 15:03:56,748 INFO L426 ceAbstractionStarter]: For program point L102-2(line 102) no Hoare annotation was computed. [2018-09-20 15:03:56,748 INFO L422 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (or (= main_~x~0 (fp.neg (_ +zero 11 53))) (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-09-20 15:03:56,748 INFO L426 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-09-20 15:03:56,748 INFO L426 ceAbstractionStarter]: For program point L102-4(lines 102 105) no Hoare annotation was computed. [2018-09-20 15:03:56,756 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-20 15:03:56,762 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-20 15:03:56,763 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-20 15:03:56,764 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-20 15:03:56,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:03:56 BoogieIcfgContainer [2018-09-20 15:03:56,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:03:56,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:03:56,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:03:56,767 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:03:56,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:02:43" (3/4) ... [2018-09-20 15:03:56,771 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:03:56,778 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure floor_double [2018-09-20 15:03:56,778 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:03:56,779 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-20 15:03:56,779 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:03:56,785 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-09-20 15:03:56,786 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-09-20 15:03:56,786 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 15:03:56,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) || !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_floor) [2018-09-20 15:03:56,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x || !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_floor) [2018-09-20 15:03:56,854 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:03:56,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:03:56,855 INFO L168 Benchmark]: Toolchain (without parser) took 75930.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 134.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:56,856 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:03:56,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.71 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:56,858 INFO L168 Benchmark]: Boogie Preprocessor took 102.17 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:03:56,858 INFO L168 Benchmark]: RCFGBuilder took 2464.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:56,858 INFO L168 Benchmark]: TraceAbstraction took 72802.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.9 MB). Peak memory consumption was 127.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:56,860 INFO L168 Benchmark]: Witness Printer took 88.19 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:56,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 464.71 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.17 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2464.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72802.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.9 MB). Peak memory consumption was 127.6 MB. Max. memory is 11.5 GB. * Witness Printer took 88.19 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. 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 RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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: 82]: Loop Invariant [2018-09-20 15:03:56,867 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-20 15:03:56,868 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE Derived loop invariant: \old(x) == x || !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_floor) - InvariantResult [Line: 19]: Loop Invariant [2018-09-20 15:03:56,868 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-20 15:03:56,875 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE Derived loop invariant: x == \old(x) || !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_floor) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 81 locations, 1 error locations. SAFE Result, 72.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 58.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 491 SDtfs, 688 SDslu, 2425 SDs, 0 SdLazy, 1384 SolverSat, 94 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 39.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 25 NumberOfFragments, 84 HoareAnnotationTreeSize, 22 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 323 ConstructedInterpolants, 175 QuantifiedInterpolants, 192825 SizeOfPredicates, 67 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...