./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-30f4e4a [2019-11-28 00:25:19,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:19,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:19,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:19,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:19,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:19,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:19,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:19,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:19,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:19,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:19,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:19,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:19,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:19,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:19,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:19,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:19,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:19,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:19,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:19,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:19,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:19,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:19,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:19,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:19,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:19,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:19,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:19,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:19,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:19,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:19,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:19,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:19,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:19,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:19,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:19,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:19,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:19,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:19,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:19,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:19,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:19,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:19,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:19,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:19,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:19,844 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:19,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:19,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:19,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:19,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:19,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:19,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:19,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:19,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:19,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:19,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:19,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:19,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:19,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:19,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:19,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:19,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:19,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:19,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:19,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:19,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:19,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:19,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:19,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:19,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2019-11-28 00:25:20,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:20,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:20,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:20,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:20,218 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:20,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-28 00:25:20,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9acc3eb1e/7da276ffa00a41b2b4ef3175afe06209/FLAGb45f59df1 [2019-11-28 00:25:20,730 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:20,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-28 00:25:20,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9acc3eb1e/7da276ffa00a41b2b4ef3175afe06209/FLAGb45f59df1 [2019-11-28 00:25:21,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9acc3eb1e/7da276ffa00a41b2b4ef3175afe06209 [2019-11-28 00:25:21,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:21,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:21,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:21,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:21,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:21,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a288275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21, skipping insertion in model container [2019-11-28 00:25:21,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:21,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:21,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:21,352 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:21,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:21,382 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:21,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21 WrapperNode [2019-11-28 00:25:21,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:21,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:21,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:21,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:21,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:21,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:21,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:21,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:21,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... [2019-11-28 00:25:21,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:21,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:21,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:21,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:21,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:21,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 00:25:21,561 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 00:25:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 00:25:21,561 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 00:25:21,775 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:21,775 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:21,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:21 BoogieIcfgContainer [2019-11-28 00:25:21,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:21,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:21,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:21,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:21,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:21" (1/3) ... [2019-11-28 00:25:21,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21119fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:21, skipping insertion in model container [2019-11-28 00:25:21,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:21" (2/3) ... [2019-11-28 00:25:21,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21119fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:21, skipping insertion in model container [2019-11-28 00:25:21,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:21" (3/3) ... [2019-11-28 00:25:21,790 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-11-28 00:25:21,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:21,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:21,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:21,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:21,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:21,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:21,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:21,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:21,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:21,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:21,896 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 00:25:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:21,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:21,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:21,922 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 00:25:21,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:21,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787425612] [2019-11-28 00:25:21,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:25:22,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787425612] [2019-11-28 00:25:22,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:22,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:25:22,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685203301] [2019-11-28 00:25:22,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:25:22,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:25:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:25:22,206 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-28 00:25:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:22,371 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 00:25:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:22,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 00:25:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:22,387 INFO L225 Difference]: With dead ends: 38 [2019-11-28 00:25:22,389 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:22,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:22,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 00:25:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:22,432 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:22,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:25:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:25:22,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:22,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:22,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 00:25:22,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:22,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028318363] [2019-11-28 00:25:22,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:25:22,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028318363] [2019-11-28 00:25:22,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:22,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:25:22,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380312152] [2019-11-28 00:25:22,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:25:22,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:25:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:25:22,527 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-28 00:25:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:22,643 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 00:25:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:22,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 00:25:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:22,646 INFO L225 Difference]: With dead ends: 32 [2019-11-28 00:25:22,646 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:25:22,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:25:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:25:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:22,656 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 00:25:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:22,656 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:22,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:25:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:25:22,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:22,658 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:22,659 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 00:25:22,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:22,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457710756] [2019-11-28 00:25:22,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:22,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457710756] [2019-11-28 00:25:22,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844109013] [2019-11-28 00:25:22,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:22,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:23,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:23,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 00:25:23,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984407303] [2019-11-28 00:25:23,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:23,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:23,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:23,050 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-28 00:25:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:23,244 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 00:25:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:23,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-28 00:25:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:23,247 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:25:23,247 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:23,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:25:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 00:25:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:25:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 00:25:23,262 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 00:25:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:23,263 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 00:25:23,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 00:25:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:23,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:23,267 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:23,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:23,474 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 00:25:23,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:23,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742637296] [2019-11-28 00:25:23,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:23,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742637296] [2019-11-28 00:25:23,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177946771] [2019-11-28 00:25:23,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:23,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:25:23,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:23,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 00:25:23,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029909904] [2019-11-28 00:25:23,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:23,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:23,782 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-28 00:25:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:24,064 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 00:25:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:24,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 00:25:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:24,071 INFO L225 Difference]: With dead ends: 55 [2019-11-28 00:25:24,075 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 00:25:24,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:25:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 00:25:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 00:25:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 00:25:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 00:25:24,094 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 00:25:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:24,096 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 00:25:24,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 00:25:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:25:24,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:24,099 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:24,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:24,304 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:24,305 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 00:25:24,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:24,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345121667] [2019-11-28 00:25:24,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:25:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345121667] [2019-11-28 00:25:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041072018] [2019-11-28 00:25:24,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:24,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:25:24,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:24,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-28 00:25:24,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162350735] [2019-11-28 00:25:24,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:25:24,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:25:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:24,667 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-28 00:25:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:25,117 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 00:25:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:25:25,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-28 00:25:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:25,120 INFO L225 Difference]: With dead ends: 114 [2019-11-28 00:25:25,120 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:25:25,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:25:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 00:25:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 00:25:25,137 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 00:25:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:25,138 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 00:25:25,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:25:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 00:25:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:25:25,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:25,140 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:25,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:25,345 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 00:25:25,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:25,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806989518] [2019-11-28 00:25:25,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:25:25,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806989518] [2019-11-28 00:25:25,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451605369] [2019-11-28 00:25:25,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:25,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:25:25,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:25,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-28 00:25:25,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089217688] [2019-11-28 00:25:25,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:25:25,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:25,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:25:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:25,697 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-28 00:25:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:26,026 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 00:25:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:26,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-28 00:25:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:26,028 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:25:26,029 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:25:26,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:25:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:25:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 00:25:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 00:25:26,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 00:25:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:26,051 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 00:25:26,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:25:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 00:25:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:25:26,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:26,055 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:26,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:26,258 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:26,259 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 00:25:26,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:26,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390764567] [2019-11-28 00:25:26,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 00:25:26,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390764567] [2019-11-28 00:25:26,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043530495] [2019-11-28 00:25:26,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:26,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:25:26,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:26,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-28 00:25:26,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027066166] [2019-11-28 00:25:26,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:25:26,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:26,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:25:26,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:26,643 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-28 00:25:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:27,182 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-28 00:25:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:25:27,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-28 00:25:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:27,185 INFO L225 Difference]: With dead ends: 164 [2019-11-28 00:25:27,185 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 00:25:27,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:25:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 00:25:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-28 00:25:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:25:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-28 00:25:27,206 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-28 00:25:27,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:27,206 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-28 00:25:27,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:25:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-28 00:25:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 00:25:27,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:27,211 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:27,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:27,419 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-28 00:25:27,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:27,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011247741] [2019-11-28 00:25:27,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 00:25:27,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011247741] [2019-11-28 00:25:27,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449492367] [2019-11-28 00:25:27,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:27,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-28 00:25:27,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:27,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-28 00:25:27,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819931681] [2019-11-28 00:25:27,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:25:27,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:25:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:27,899 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-11-28 00:25:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:28,551 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-28 00:25:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:25:28,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-11-28 00:25:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:28,555 INFO L225 Difference]: With dead ends: 207 [2019-11-28 00:25:28,555 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 00:25:28,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:25:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 00:25:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-28 00:25:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 00:25:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-28 00:25:28,575 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-28 00:25:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:28,575 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-28 00:25:28,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:25:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-28 00:25:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 00:25:28,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:28,581 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:28,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:28,787 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-28 00:25:28,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:28,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612364711] [2019-11-28 00:25:28,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-28 00:25:29,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612364711] [2019-11-28 00:25:29,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379595384] [2019-11-28 00:25:29,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:29,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-28 00:25:29,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:29,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2019-11-28 00:25:29,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422118321] [2019-11-28 00:25:29,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:25:29,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:25:29,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:29,294 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 20 states. [2019-11-28 00:25:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:29,835 INFO L93 Difference]: Finished difference Result 209 states and 348 transitions. [2019-11-28 00:25:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:25:29,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-11-28 00:25:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:29,838 INFO L225 Difference]: With dead ends: 209 [2019-11-28 00:25:29,838 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 00:25:29,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 00:25:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-11-28 00:25:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 00:25:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 175 transitions. [2019-11-28 00:25:29,856 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 175 transitions. Word has length 119 [2019-11-28 00:25:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:29,856 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 175 transitions. [2019-11-28 00:25:29,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:25:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 175 transitions. [2019-11-28 00:25:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-28 00:25:29,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:29,860 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:30,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:30,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 332281067, now seen corresponding path program 2 times [2019-11-28 00:25:30,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:30,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366997913] [2019-11-28 00:25:30,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 311 proven. 245 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-28 00:25:30,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366997913] [2019-11-28 00:25:30,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329038941] [2019-11-28 00:25:30,764 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:30,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:30,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:30,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:30,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 89 proven. 154 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-11-28 00:25:31,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:31,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 29 [2019-11-28 00:25:31,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768756437] [2019-11-28 00:25:31,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 00:25:31,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:31,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 00:25:31,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:25:31,026 INFO L87 Difference]: Start difference. First operand 111 states and 175 transitions. Second operand 29 states. [2019-11-28 00:25:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:31,896 INFO L93 Difference]: Finished difference Result 233 states and 404 transitions. [2019-11-28 00:25:31,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-28 00:25:31,897 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 188 [2019-11-28 00:25:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:31,899 INFO L225 Difference]: With dead ends: 233 [2019-11-28 00:25:31,900 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 00:25:31,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 00:25:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 00:25:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-11-28 00:25:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 00:25:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2019-11-28 00:25:31,913 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 188 [2019-11-28 00:25:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:31,914 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2019-11-28 00:25:31,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 00:25:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2019-11-28 00:25:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 00:25:31,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:31,917 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:32,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:32,124 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 3 times [2019-11-28 00:25:32,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:32,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045038766] [2019-11-28 00:25:32,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 210 proven. 368 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-11-28 00:25:32,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045038766] [2019-11-28 00:25:32,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882199834] [2019-11-28 00:25:32,890 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:32,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 00:25:32,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:32,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:32,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 294 proven. 58 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2019-11-28 00:25:33,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:33,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 32 [2019-11-28 00:25:33,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110702588] [2019-11-28 00:25:33,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 00:25:33,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 00:25:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:25:33,312 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 32 states. [2019-11-28 00:25:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:34,657 INFO L93 Difference]: Finished difference Result 266 states and 449 transitions. [2019-11-28 00:25:34,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-28 00:25:34,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2019-11-28 00:25:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:34,663 INFO L225 Difference]: With dead ends: 266 [2019-11-28 00:25:34,664 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 00:25:34,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2019-11-28 00:25:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 00:25:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-11-28 00:25:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 00:25:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2019-11-28 00:25:34,686 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 214 [2019-11-28 00:25:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:34,687 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2019-11-28 00:25:34,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 00:25:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2019-11-28 00:25:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-28 00:25:34,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:34,690 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:34,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:34,905 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 4 times [2019-11-28 00:25:34,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:34,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918921273] [2019-11-28 00:25:34,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 145 proven. 138 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-28 00:25:35,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918921273] [2019-11-28 00:25:35,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993369746] [2019-11-28 00:25:35,446 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:35,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:35,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:35,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:35,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-28 00:25:35,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:35,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 25 [2019-11-28 00:25:35,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723645844] [2019-11-28 00:25:35,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:25:35,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:35,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:25:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:25:35,591 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand 25 states. [2019-11-28 00:25:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:36,214 INFO L93 Difference]: Finished difference Result 285 states and 429 transitions. [2019-11-28 00:25:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:25:36,217 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-11-28 00:25:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:36,220 INFO L225 Difference]: With dead ends: 285 [2019-11-28 00:25:36,220 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 00:25:36,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:25:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 00:25:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2019-11-28 00:25:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-28 00:25:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2019-11-28 00:25:36,241 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 146 [2019-11-28 00:25:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:36,243 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2019-11-28 00:25:36,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:25:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2019-11-28 00:25:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-28 00:25:36,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:36,249 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:36,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:36,454 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1338982035, now seen corresponding path program 5 times [2019-11-28 00:25:36,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:36,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242730567] [2019-11-28 00:25:36,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 202 proven. 153 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-11-28 00:25:36,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242730567] [2019-11-28 00:25:36,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133060473] [2019-11-28 00:25:36,997 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:37,099 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-28 00:25:37,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:37,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:25:37,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 135 proven. 196 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-11-28 00:25:37,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:37,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 28 [2019-11-28 00:25:37,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519941021] [2019-11-28 00:25:37,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:25:37,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:37,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:25:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:37,268 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand 28 states. [2019-11-28 00:25:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:37,819 INFO L93 Difference]: Finished difference Result 286 states and 417 transitions. [2019-11-28 00:25:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 00:25:37,820 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2019-11-28 00:25:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:37,823 INFO L225 Difference]: With dead ends: 286 [2019-11-28 00:25:37,823 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 00:25:37,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 00:25:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2019-11-28 00:25:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 00:25:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2019-11-28 00:25:37,837 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 160 [2019-11-28 00:25:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:37,837 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2019-11-28 00:25:37,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:25:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2019-11-28 00:25:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 00:25:37,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:37,840 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:38,044 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 6 times [2019-11-28 00:25:38,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908764499] [2019-11-28 00:25:38,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:25:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:25:38,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:25:38,112 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:25:38,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:25:38 BoogieIcfgContainer [2019-11-28 00:25:38,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:25:38,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:25:38,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:25:38,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:25:38,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:21" (3/4) ... [2019-11-28 00:25:38,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:25:38,287 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:25:38,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:25:38,289 INFO L168 Benchmark]: Toolchain (without parser) took 17172.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 960.4 MB in the beginning and 849.5 MB in the end (delta: 110.9 MB). Peak memory consumption was 469.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:38,290 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:38,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:38,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.57 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:38,291 INFO L168 Benchmark]: Boogie Preprocessor took 99.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:38,291 INFO L168 Benchmark]: RCFGBuilder took 267.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:38,292 INFO L168 Benchmark]: TraceAbstraction took 16410.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 849.5 MB in the end (delta: 272.6 MB). Peak memory consumption was 485.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:38,292 INFO L168 Benchmark]: Witness Printer took 96.94 ms. Allocated memory is still 1.4 GB. Free memory is still 849.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:38,294 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 27.57 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16410.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 849.5 MB in the end (delta: 272.6 MB). Peak memory consumption was 485.5 MB. Max. memory is 11.5 GB. * Witness Printer took 96.94 ms. Allocated memory is still 1.4 GB. Free memory is still 849.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.2s, OverallIterations: 14, TraceHistogramMax: 17, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 799 SDslu, 3206 SDs, 0 SdLazy, 5730 SolverSat, 857 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1685 GetRequests, 1376 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 147 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2360 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2163 ConstructedInterpolants, 0 QuantifiedInterpolants, 562203 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2164 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 6301/8076 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...