./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 09:53:05,159 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:53:05,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:53:05,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:53:05,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:53:05,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:53:05,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:53:05,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:53:05,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:53:05,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:53:05,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:53:05,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:53:05,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:53:05,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:53:05,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:53:05,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:53:05,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:53:05,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:53:05,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:53:05,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:53:05,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:53:05,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:53:05,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:53:05,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:53:05,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:53:05,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:53:05,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:53:05,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:53:05,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:53:05,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:53:05,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:53:05,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:53:05,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:53:05,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:53:05,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:53:05,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:53:05,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:53:05,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:53:05,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:53:05,231 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:53:05,231 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:53:05,231 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:53:05,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:53:05,232 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:53:05,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:53:05,232 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:53:05,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:53:05,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:53:05,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:53:05,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:53:05,233 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:53:05,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:53:05,233 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:53:05,234 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:53:05,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:53:05,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:53:05,234 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:53:05,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:53:05,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:53:05,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:53:05,235 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:53:05,235 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:53:05,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:53:05,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:53:05,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:53:05,236 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe571d33601eb001defa960d70b02ea99b59263c [2018-12-31 09:53:05,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:53:05,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:53:05,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:53:05,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:53:05,319 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:53:05,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-31 09:53:05,395 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab776a7/7954059372d1451e86e61d8192ad101a/FLAG932550039 [2018-12-31 09:53:05,917 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:53:05,918 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-31 09:53:05,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab776a7/7954059372d1451e86e61d8192ad101a/FLAG932550039 [2018-12-31 09:53:06,278 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab776a7/7954059372d1451e86e61d8192ad101a [2018-12-31 09:53:06,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:53:06,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:53:06,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:53:06,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:53:06,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:53:06,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc051ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06, skipping insertion in model container [2018-12-31 09:53:06,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:53:06,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:53:06,524 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:53:06,529 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:53:06,555 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:53:06,573 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:53:06,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06 WrapperNode [2018-12-31 09:53:06,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:53:06,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:53:06,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:53:06,575 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:53:06,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:53:06,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:53:06,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:53:06,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:53:06,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... [2018-12-31 09:53:06,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:53:06,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:53:06,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:53:06,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:53:06,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:53:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:53:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:53:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-31 09:53:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-31 09:53:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-31 09:53:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-31 09:53:07,409 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:53:07,409 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:53:07,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:07 BoogieIcfgContainer [2018-12-31 09:53:07,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:53:07,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:53:07,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:53:07,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:53:07,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:53:06" (1/3) ... [2018-12-31 09:53:07,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e13251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:53:07, skipping insertion in model container [2018-12-31 09:53:07,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:06" (2/3) ... [2018-12-31 09:53:07,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e13251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:53:07, skipping insertion in model container [2018-12-31 09:53:07,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:07" (3/3) ... [2018-12-31 09:53:07,421 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-31 09:53:07,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:53:07,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:53:07,458 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:53:07,492 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:53:07,493 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:53:07,493 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:53:07,493 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:53:07,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:53:07,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:53:07,494 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:53:07,494 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:53:07,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:53:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 09:53:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:53:07,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:07,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:07,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:07,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2018-12-31 09:53:07,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:07,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:07,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:07,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:53:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:53:07,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:53:07,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:53:07,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:53:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:53:07,799 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-31 09:53:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:08,026 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-12-31 09:53:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:53:08,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:53:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:08,038 INFO L225 Difference]: With dead ends: 38 [2018-12-31 09:53:08,039 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 09:53:08,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:53:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 09:53:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 09:53:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 09:53:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 09:53:08,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2018-12-31 09:53:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:08,092 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 09:53:08,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:53:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 09:53:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:53:08,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:08,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:08,095 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2018-12-31 09:53:08,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:08,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:08,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:08,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:53:08,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:53:08,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:53:08,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:53:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:53:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:53:08,171 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2018-12-31 09:53:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:08,385 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-12-31 09:53:08,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:53:08,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:53:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:08,388 INFO L225 Difference]: With dead ends: 32 [2018-12-31 09:53:08,389 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 09:53:08,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:53:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 09:53:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 09:53:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 09:53:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 09:53:08,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2018-12-31 09:53:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:08,402 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 09:53:08,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:53:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 09:53:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:53:08,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:08,405 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:08,406 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2018-12-31 09:53:08,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:08,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:08,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:08,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:08,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:08,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:08,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:08,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:09,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:09,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-31 09:53:09,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:53:09,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:53:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:53:09,086 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2018-12-31 09:53:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:09,623 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2018-12-31 09:53:09,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:09,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-31 09:53:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:09,626 INFO L225 Difference]: With dead ends: 54 [2018-12-31 09:53:09,627 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 09:53:09,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:53:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 09:53:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-31 09:53:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 09:53:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 09:53:09,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2018-12-31 09:53:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:09,637 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 09:53:09,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:53:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 09:53:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:53:09,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:09,639 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:09,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2018-12-31 09:53:09,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:09,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:09,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:09,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:09,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:09,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:09,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:53:09,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:53:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:53:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:53:09,867 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-12-31 09:53:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:10,305 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2018-12-31 09:53:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:53:10,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 09:53:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:10,310 INFO L225 Difference]: With dead ends: 39 [2018-12-31 09:53:10,313 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 09:53:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:53:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 09:53:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-31 09:53:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 09:53:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-31 09:53:10,340 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2018-12-31 09:53:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-31 09:53:10,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:53:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-31 09:53:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:53:10,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:10,344 INFO L402 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] [2018-12-31 09:53:10,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2018-12-31 09:53:10,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:10,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:10,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:53:10,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:10,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:10,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:53:10,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:10,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-31 09:53:10,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:10,749 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2018-12-31 09:53:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:11,186 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2018-12-31 09:53:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:53:11,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-31 09:53:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:11,191 INFO L225 Difference]: With dead ends: 66 [2018-12-31 09:53:11,191 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 09:53:11,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:53:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 09:53:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 09:53:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 09:53:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-12-31 09:53:11,203 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2018-12-31 09:53:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:11,203 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-12-31 09:53:11,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2018-12-31 09:53:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:53:11,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:11,205 INFO L402 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] [2018-12-31 09:53:11,206 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2018-12-31 09:53:11,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:11,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:11,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:11,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:11,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 09:53:11,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:11,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:11,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:11,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:53:11,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:11,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-31 09:53:11,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:11,463 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2018-12-31 09:53:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:11,739 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-12-31 09:53:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:11,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-31 09:53:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:11,744 INFO L225 Difference]: With dead ends: 57 [2018-12-31 09:53:11,744 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 09:53:11,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 09:53:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-12-31 09:53:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 09:53:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-12-31 09:53:11,762 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2018-12-31 09:53:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:11,762 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-31 09:53:11,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2018-12-31 09:53:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 09:53:11,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:11,765 INFO L402 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] [2018-12-31 09:53:11,765 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2018-12-31 09:53:11,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:11,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:11,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 09:53:11,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:11,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:11,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:11,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-31 09:53:11,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:11,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-31 09:53:11,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:12,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:12,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:12,001 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 10 states. [2018-12-31 09:53:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:12,450 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2018-12-31 09:53:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:12,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-12-31 09:53:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:12,455 INFO L225 Difference]: With dead ends: 67 [2018-12-31 09:53:12,458 INFO L226 Difference]: Without dead ends: 63 [2018-12-31 09:53:12,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-31 09:53:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2018-12-31 09:53:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:53:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2018-12-31 09:53:12,485 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 50 [2018-12-31 09:53:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:12,487 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2018-12-31 09:53:12,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2018-12-31 09:53:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 09:53:12,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:12,491 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:12,492 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1353550601, now seen corresponding path program 2 times [2018-12-31 09:53:12,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:12,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:12,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:12,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 09:53:12,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:12,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:12,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:53:12,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:53:12,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:12,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-31 09:53:13,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:13,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-12-31 09:53:13,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 09:53:13,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 09:53:13,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:53:13,142 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 14 states. [2018-12-31 09:53:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:13,804 INFO L93 Difference]: Finished difference Result 123 states and 234 transitions. [2018-12-31 09:53:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 09:53:13,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2018-12-31 09:53:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:13,809 INFO L225 Difference]: With dead ends: 123 [2018-12-31 09:53:13,810 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:53:13,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-12-31 09:53:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:53:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2018-12-31 09:53:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-31 09:53:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 97 transitions. [2018-12-31 09:53:13,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 97 transitions. Word has length 76 [2018-12-31 09:53:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:13,828 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 97 transitions. [2018-12-31 09:53:13,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 09:53:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 97 transitions. [2018-12-31 09:53:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 09:53:13,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:13,831 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:13,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1328267489, now seen corresponding path program 1 times [2018-12-31 09:53:13,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:13,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:13,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:13,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-31 09:53:13,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:13,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:14,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 30 proven. 41 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-31 09:53:14,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:14,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-12-31 09:53:14,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 09:53:14,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 09:53:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:14,187 INFO L87 Difference]: Start difference. First operand 61 states and 97 transitions. Second operand 15 states. [2018-12-31 09:53:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:15,202 INFO L93 Difference]: Finished difference Result 176 states and 345 transitions. [2018-12-31 09:53:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 09:53:15,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2018-12-31 09:53:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:15,208 INFO L225 Difference]: With dead ends: 176 [2018-12-31 09:53:15,209 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 09:53:15,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-12-31 09:53:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 09:53:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2018-12-31 09:53:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-31 09:53:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 155 transitions. [2018-12-31 09:53:15,230 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 155 transitions. Word has length 91 [2018-12-31 09:53:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:15,230 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 155 transitions. [2018-12-31 09:53:15,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 09:53:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 155 transitions. [2018-12-31 09:53:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 09:53:15,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:15,233 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:15,234 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1985146669, now seen corresponding path program 2 times [2018-12-31 09:53:15,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:15,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:15,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:15,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:15,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-31 09:53:15,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:15,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:53:15,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:53:15,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:15,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-31 09:53:15,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:15,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2018-12-31 09:53:15,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 09:53:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 09:53:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:15,700 INFO L87 Difference]: Start difference. First operand 93 states and 155 transitions. Second operand 15 states. [2018-12-31 09:53:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:17,368 INFO L93 Difference]: Finished difference Result 249 states and 500 transitions. [2018-12-31 09:53:17,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 09:53:17,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-12-31 09:53:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:17,373 INFO L225 Difference]: With dead ends: 249 [2018-12-31 09:53:17,373 INFO L226 Difference]: Without dead ends: 162 [2018-12-31 09:53:17,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-12-31 09:53:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-31 09:53:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2018-12-31 09:53:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-31 09:53:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 271 transitions. [2018-12-31 09:53:17,414 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 271 transitions. Word has length 78 [2018-12-31 09:53:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:17,414 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 271 transitions. [2018-12-31 09:53:17,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 09:53:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 271 transitions. [2018-12-31 09:53:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-31 09:53:17,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:17,423 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:17,424 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:17,424 INFO L82 PathProgramCache]: Analyzing trace with hash -704583867, now seen corresponding path program 3 times [2018-12-31 09:53:17,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:17,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:17,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:17,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:17,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-31 09:53:17,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:17,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:53:17,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 09:53:17,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:17,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-31 09:53:17,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:53:17,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:53:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:53:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:53:17,883 INFO L87 Difference]: Start difference. First operand 150 states and 271 transitions. Second operand 7 states. [2018-12-31 09:53:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:18,127 INFO L93 Difference]: Finished difference Result 305 states and 614 transitions. [2018-12-31 09:53:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:53:18,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-12-31 09:53:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:18,138 INFO L225 Difference]: With dead ends: 305 [2018-12-31 09:53:18,139 INFO L226 Difference]: Without dead ends: 163 [2018-12-31 09:53:18,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:53:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-31 09:53:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2018-12-31 09:53:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 09:53:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 274 transitions. [2018-12-31 09:53:18,192 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 274 transitions. Word has length 106 [2018-12-31 09:53:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:18,193 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 274 transitions. [2018-12-31 09:53:18,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:53:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 274 transitions. [2018-12-31 09:53:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-31 09:53:18,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:18,197 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:18,197 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash -265094421, now seen corresponding path program 1 times [2018-12-31 09:53:18,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:18,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:18,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-12-31 09:53:18,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:18,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:18,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-31 09:53:18,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:18,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-12-31 09:53:18,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 09:53:18,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 09:53:18,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:53:18,768 INFO L87 Difference]: Start difference. First operand 152 states and 274 transitions. Second operand 12 states. [2018-12-31 09:53:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:19,612 INFO L93 Difference]: Finished difference Result 304 states and 624 transitions. [2018-12-31 09:53:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 09:53:19,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 106 [2018-12-31 09:53:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:19,616 INFO L225 Difference]: With dead ends: 304 [2018-12-31 09:53:19,616 INFO L226 Difference]: Without dead ends: 105 [2018-12-31 09:53:19,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-12-31 09:53:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-31 09:53:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-31 09:53:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-31 09:53:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2018-12-31 09:53:19,632 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 106 [2018-12-31 09:53:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:19,634 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2018-12-31 09:53:19,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 09:53:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2018-12-31 09:53:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 09:53:19,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:19,635 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:19,637 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:19,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1882786525, now seen corresponding path program 2 times [2018-12-31 09:53:19,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:19,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:19,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-31 09:53:19,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:19,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:53:19,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:53:19,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:19,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-31 09:53:19,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:19,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-31 09:53:19,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:53:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:53:19,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:53:19,972 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand 8 states. [2018-12-31 09:53:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:20,113 INFO L93 Difference]: Finished difference Result 120 states and 175 transitions. [2018-12-31 09:53:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:53:20,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-12-31 09:53:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:20,119 INFO L225 Difference]: With dead ends: 120 [2018-12-31 09:53:20,119 INFO L226 Difference]: Without dead ends: 116 [2018-12-31 09:53:20,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:53:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-31 09:53:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-12-31 09:53:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-31 09:53:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2018-12-31 09:53:20,132 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 91 [2018-12-31 09:53:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:20,132 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2018-12-31 09:53:20,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:53:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2018-12-31 09:53:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 09:53:20,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:20,135 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:20,136 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1335172610, now seen corresponding path program 3 times [2018-12-31 09:53:20,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:20,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:20,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:20,191 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:53:20,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:53:20 BoogieIcfgContainer [2018-12-31 09:53:20,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:53:20,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:53:20,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:53:20,261 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:53:20,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:07" (3/4) ... [2018-12-31 09:53:20,267 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:53:20,386 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:53:20,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:53:20,391 INFO L168 Benchmark]: Toolchain (without parser) took 14106.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -99.4 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:20,393 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:20,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:20,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:20,395 INFO L168 Benchmark]: Boogie Preprocessor took 32.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:20,395 INFO L168 Benchmark]: RCFGBuilder took 759.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -123.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:20,395 INFO L168 Benchmark]: TraceAbstraction took 12849.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:20,406 INFO L168 Benchmark]: Witness Printer took 128.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 09:53:20,408 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 41.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 759.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -123.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12849.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. * Witness Printer took 128.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 = 5; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 5 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. UNSAFE Result, 12.7s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 404 SDslu, 1518 SDs, 0 SdLazy, 2391 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 716 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 107 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1423 ConstructedInterpolants, 0 QuantifiedInterpolants, 166495 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1466 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 2160/2558 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...