./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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 /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.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 d3562c726fb0df5872bc6ae08c11ec0d40862c19 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:49:33,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:49:33,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:49:33,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:49:33,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:49:33,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:49:33,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:49:33,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:49:33,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:49:33,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:49:33,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:49:33,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:49:33,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:49:33,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:49:33,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:49:33,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:49:33,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:49:33,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:49:33,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:49:33,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:49:33,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:49:33,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:49:33,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:49:33,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:49:33,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:49:33,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:49:33,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:49:33,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:49:33,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:49:33,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:49:33,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:49:33,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:49:33,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:49:33,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:49:33,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:49:33,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:49:33,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:49:33,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:49:33,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:49:33,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:49:33,078 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:49:33,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:49:33,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:49:33,080 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:49:33,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:49:33,080 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:49:33,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:49:33,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:49:33,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:49:33,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:49:33,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:49:33,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:49:33,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:49:33,082 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:49:33,082 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:49:33,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:49:33,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:49:33,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:49:33,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:49:33,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:49:33,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:49:33,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:49:33,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:49:33,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:49:33,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:49:33,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:49:33,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:49:33,086 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 -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2018-11-28 18:49:33,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:49:33,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:49:33,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:49:33,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:49:33,141 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:49:33,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:33,204 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24591922f/a098693e5bda4c87bc8ffa0fd82732c8/FLAG9c863cae2 [2018-11-28 18:49:33,647 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:49:33,647 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:33,654 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24591922f/a098693e5bda4c87bc8ffa0fd82732c8/FLAG9c863cae2 [2018-11-28 18:49:34,009 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24591922f/a098693e5bda4c87bc8ffa0fd82732c8 [2018-11-28 18:49:34,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:49:34,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:49:34,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:34,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:49:34,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:49:34,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7108c9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34, skipping insertion in model container [2018-11-28 18:49:34,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:49:34,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:49:34,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:34,287 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:49:34,309 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:34,329 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:49:34,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34 WrapperNode [2018-11-28 18:49:34,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:34,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:34,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:49:34,331 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:49:34,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:34,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:49:34,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:49:34,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:49:34,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:49:34,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:49:34,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:49:34,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:49:34,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (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-11-28 18:49:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-28 18:49:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-28 18:49:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:49:34,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:49:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:49:34,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:49:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:49:34,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:49:34,962 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:49:34,962 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:49:34,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:34 BoogieIcfgContainer [2018-11-28 18:49:34,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:49:34,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:49:34,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:49:34,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:49:34,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:49:34" (1/3) ... [2018-11-28 18:49:34,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d494ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:34, skipping insertion in model container [2018-11-28 18:49:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (2/3) ... [2018-11-28 18:49:34,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d494ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:34, skipping insertion in model container [2018-11-28 18:49:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:34" (3/3) ... [2018-11-28 18:49:34,972 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:34,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:49:34,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:49:35,008 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:49:35,041 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:49:35,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:49:35,042 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:49:35,042 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:49:35,042 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:49:35,042 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:49:35,042 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:49:35,042 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:49:35,043 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:49:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-28 18:49:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:49:35,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:35,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:35,081 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:35,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-11-28 18:49:35,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:35,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:35,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:49:35,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:49:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:49:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:49:35,544 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-28 18:49:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:35,760 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-28 18:49:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:49:35,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:49:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:35,772 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:49:35,773 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 18:49:35,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 18:49:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 18:49:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:49:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:49:35,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-28 18:49:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:35,821 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:49:35,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:49:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:49:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:49:35,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:35,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:35,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:35,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-11-28 18:49:35,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:35,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:35,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:35,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:49:35,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:49:35,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:49:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:49:35,890 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-28 18:49:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:36,141 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 18:49:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:49:36,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:49:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:36,144 INFO L225 Difference]: With dead ends: 27 [2018-11-28 18:49:36,144 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:49:36,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:49:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 18:49:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:49:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:49:36,159 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-28 18:49:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:36,159 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:49:36,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:49:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:49:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:49:36,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:36,161 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:36,161 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:36,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-11-28 18:49:36,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:49:36,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:36,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:36,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:36,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:49:36,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:36,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 18:49:36,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:49:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:49:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:36,575 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-28 18:49:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:36,936 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-28 18:49:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:49:36,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 18:49:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:36,939 INFO L225 Difference]: With dead ends: 38 [2018-11-28 18:49:36,940 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:49:36,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:49:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 18:49:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:49:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 18:49:36,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-28 18:49:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:36,949 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 18:49:36,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:49:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 18:49:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:49:36,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:36,951 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:36,951 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:36,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-11-28 18:49:36,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:49:37,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:37,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:37,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:37,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:49:37,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:37,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 18:49:37,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:49:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:49:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:37,236 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-28 18:49:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:37,620 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-28 18:49:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:49:37,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 18:49:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:37,624 INFO L225 Difference]: With dead ends: 32 [2018-11-28 18:49:37,624 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:49:37,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:49:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 18:49:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:49:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-28 18:49:37,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-28 18:49:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:37,640 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-28 18:49:37,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:49:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-28 18:49:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:49:37,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:37,644 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:37,645 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:37,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-11-28 18:49:37,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:37,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 18:49:37,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:37,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:49:37,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:49:37,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:37,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 18:49:37,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:37,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-28 18:49:37,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:49:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:49:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:49:37,895 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-11-28 18:49:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:38,196 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-11-28 18:49:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:49:38,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-28 18:49:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:38,199 INFO L225 Difference]: With dead ends: 42 [2018-11-28 18:49:38,199 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:49:38,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:49:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:49:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-28 18:49:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:49:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-28 18:49:38,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-28 18:49:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:38,214 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-28 18:49:38,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:49:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-28 18:49:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 18:49:38,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:38,218 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:38,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:38,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-11-28 18:49:38,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:38,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-28 18:49:38,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:38,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:38,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:49:38,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 18:49:38,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:38,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-28 18:49:38,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:38,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-28 18:49:38,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:49:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:49:38,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:38,678 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-28 18:49:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:39,331 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-28 18:49:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:49:39,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-28 18:49:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:39,338 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:49:39,338 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:49:39,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:49:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:49:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-28 18:49:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 18:49:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-28 18:49:39,357 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-28 18:49:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:39,358 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-28 18:49:39,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:49:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-28 18:49:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 18:49:39,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:39,362 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:39,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:39,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:39,363 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2018-11-28 18:49:39,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:39,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:39,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:39,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-28 18:49:39,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:39,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:39,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:49:39,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:49:39,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:39,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-28 18:49:39,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-28 18:49:39,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:49:39,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:49:39,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:39,715 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-11-28 18:49:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:39,987 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-28 18:49:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:49:39,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-28 18:49:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:39,991 INFO L225 Difference]: With dead ends: 52 [2018-11-28 18:49:39,992 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 18:49:39,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 18:49:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 18:49:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 18:49:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-28 18:49:40,007 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-11-28 18:49:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:40,007 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-28 18:49:40,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:49:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-28 18:49:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-28 18:49:40,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:40,012 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 17, 9, 9, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:40,013 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:40,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 507335743, now seen corresponding path program 5 times [2018-11-28 18:49:40,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:40,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:40,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:40,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 134 proven. 134 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-11-28 18:49:40,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:40,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:49:40,463 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-28 18:49:40,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:40,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 560 proven. 77 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-11-28 18:49:40,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:40,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 11 [2018-11-28 18:49:40,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:49:40,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:49:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:49:40,817 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 11 states. [2018-11-28 18:49:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:41,143 INFO L93 Difference]: Finished difference Result 94 states and 162 transitions. [2018-11-28 18:49:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:49:41,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2018-11-28 18:49:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:41,146 INFO L225 Difference]: With dead ends: 94 [2018-11-28 18:49:41,146 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 18:49:41,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:49:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 18:49:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 18:49:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 18:49:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-28 18:49:41,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 138 [2018-11-28 18:49:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:41,159 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-28 18:49:41,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:49:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-28 18:49:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 18:49:41,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:41,162 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:41,163 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:41,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1066463687, now seen corresponding path program 6 times [2018-11-28 18:49:41,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:41,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:41,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 241 proven. 102 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2018-11-28 18:49:41,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:41,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:41,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:49:41,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-28 18:49:41,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:41,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 259 proven. 59 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-11-28 18:49:41,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:41,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-28 18:49:41,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:49:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:49:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:41,643 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 12 states. [2018-11-28 18:49:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:41,923 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2018-11-28 18:49:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:49:41,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 136 [2018-11-28 18:49:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:41,926 INFO L225 Difference]: With dead ends: 66 [2018-11-28 18:49:41,926 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 18:49:41,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:49:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 18:49:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-28 18:49:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 18:49:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-28 18:49:41,936 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 136 [2018-11-28 18:49:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:41,937 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-28 18:49:41,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:49:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-28 18:49:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-28 18:49:41,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:41,940 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:41,941 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:41,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 7 times [2018-11-28 18:49:41,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:41,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:41,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:41,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:49:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:49:42,004 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:49:42,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:49:42 BoogieIcfgContainer [2018-11-28 18:49:42,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:49:42,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:49:42,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:49:42,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:49:42,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:34" (3/4) ... [2018-11-28 18:49:42,052 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:49:42,129 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:49:42,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:49:42,131 INFO L168 Benchmark]: Toolchain (without parser) took 8117.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 952.7 MB in the beginning and 979.2 MB in the end (delta: -26.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:42,133 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:42,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:42,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.65 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:42,135 INFO L168 Benchmark]: Boogie Preprocessor took 22.37 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:42,135 INFO L168 Benchmark]: RCFGBuilder took 580.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:42,137 INFO L168 Benchmark]: TraceAbstraction took 7083.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 979.2 MB in the end (delta: 112.2 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:42,138 INFO L168 Benchmark]: Witness Printer took 82.34 ms. Allocated memory is still 1.2 GB. Free memory is still 979.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:42,142 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.65 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.37 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 580.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7083.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 979.2 MB in the end (delta: 112.2 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. * Witness Printer took 82.34 ms. Allocated memory is still 1.2 GB. Free memory is still 979.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 7.0s OverallTime, 10 OverallIterations, 19 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 176 SDslu, 491 SDs, 0 SdLazy, 620 SolverSat, 211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 540 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1198 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1073 ConstructedInterpolants, 0 QuantifiedInterpolants, 161759 SizeOfPredicates, 30 NumberOfNonLiveVariables, 912 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 4590/5170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...