./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_4_true-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 ffdaeeffc8c5fdb555812137dbba1199bd1a626d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:11:08,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:11:08,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:11:08,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:11:08,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:11:08,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:11:08,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:11:08,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:11:08,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:11:08,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:11:08,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:11:08,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:11:08,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:11:08,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:11:08,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:11:08,181 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:11:08,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:11:08,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:11:08,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:11:08,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:11:08,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:11:08,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:11:08,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:11:08,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:11:08,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:11:08,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:11:08,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:11:08,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:11:08,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:11:08,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:11:08,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:11:08,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:11:08,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:11:08,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:11:08,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:11:08,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:11:08,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:11:08,219 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:11:08,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:11:08,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:11:08,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:11:08,222 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:11:08,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:11:08,222 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:11:08,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:11:08,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:11:08,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:11:08,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:11:08,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:11:08,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:11:08,223 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:11:08,223 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:11:08,224 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:11:08,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:11:08,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:11:08,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:11:08,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:11:08,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:11:08,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:08,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:11:08,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:11:08,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:11:08,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:11:08,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:11:08,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:11:08,228 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 -> ffdaeeffc8c5fdb555812137dbba1199bd1a626d [2019-01-12 15:11:08,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:11:08,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:11:08,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:11:08,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:11:08,283 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:11:08,284 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c [2019-01-12 15:11:08,358 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4e80034/f740d05c864d434ca46b3e9cb32f1699/FLAG8d14583b0 [2019-01-12 15:11:08,759 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:11:08,759 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c [2019-01-12 15:11:08,765 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4e80034/f740d05c864d434ca46b3e9cb32f1699/FLAG8d14583b0 [2019-01-12 15:11:09,133 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4e80034/f740d05c864d434ca46b3e9cb32f1699 [2019-01-12 15:11:09,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:11:09,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:11:09,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:09,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:11:09,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:11:09,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b552cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09, skipping insertion in model container [2019-01-12 15:11:09,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:11:09,180 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:11:09,406 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:09,411 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:11:09,430 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:09,446 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:11:09,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09 WrapperNode [2019-01-12 15:11:09,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:09,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:09,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:11:09,448 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:11:09,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:09,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:11:09,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:11:09,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:11:09,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... [2019-01-12 15:11:09,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:11:09,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:11:09,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:11:09,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:11:09,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:11:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:11:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-12 15:11:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-12 15:11:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-12 15:11:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-12 15:11:09,981 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:11:09,982 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:11:09,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:09 BoogieIcfgContainer [2019-01-12 15:11:09,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:11:09,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:11:09,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:11:09,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:11:09,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:11:09" (1/3) ... [2019-01-12 15:11:09,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee64b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:09, skipping insertion in model container [2019-01-12 15:11:09,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:09" (2/3) ... [2019-01-12 15:11:09,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee64b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:09, skipping insertion in model container [2019-01-12 15:11:09,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:09" (3/3) ... [2019-01-12 15:11:09,990 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4_true-unreach-call_true-termination.c [2019-01-12 15:11:09,998 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:11:10,005 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:11:10,019 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:11:10,053 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:11:10,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:11:10,054 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:11:10,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:11:10,055 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:11:10,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:11:10,056 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:11:10,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:11:10,056 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:11:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 15:11:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:11:10,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:10,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:10,085 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-01-12 15:11:10,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:11:10,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:10,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:10,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:10,319 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-01-12 15:11:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:10,464 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-01-12 15:11:10,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:10,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:11:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:10,477 INFO L225 Difference]: With dead ends: 38 [2019-01-12 15:11:10,477 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:11:10,480 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 [2019-01-12 15:11:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:11:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:11:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 15:11:10,524 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-01-12 15:11:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:10,524 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 15:11:10,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 15:11:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 15:11:10,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:10,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:10,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-01-12 15:11:10,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:10,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:10,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:10,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:10,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:11:10,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:10,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:10,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:10,781 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-01-12 15:11:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:11,104 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-01-12 15:11:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:11,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 15:11:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:11,106 INFO L225 Difference]: With dead ends: 32 [2019-01-12 15:11:11,106 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 15:11:11,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:11:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 15:11:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 15:11:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 15:11:11,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-01-12 15:11:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:11,116 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 15:11:11,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 15:11:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 15:11:11,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:11,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:11,118 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-01-12 15:11:11,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:11:11,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:11,289 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 [2019-01-12 15:11:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:11,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:11:11,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:11,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 15:11:11,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:11:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:11:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:11,501 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2019-01-12 15:11:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:12,229 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2019-01-12 15:11:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:11:12,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-12 15:11:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:12,232 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:11:12,232 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 15:11:12,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 15:11:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-12 15:11:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 15:11:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 15:11:12,258 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2019-01-12 15:11:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:12,262 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 15:11:12,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:11:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 15:11:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:12,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:12,266 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] [2019-01-12 15:11:12,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:12,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-01-12 15:11:12,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:12,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:11:12,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:12,445 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 [2019-01-12 15:11:12,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:12,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:11:12,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:12,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:11:12,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:11:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:11:12,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:11:12,526 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2019-01-12 15:11:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:12,743 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-01-12 15:11:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:11:12,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 15:11:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:12,747 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:11:12,747 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:11:12,748 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 [2019-01-12 15:11:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:11:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-12 15:11:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 15:11:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-01-12 15:11:12,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2019-01-12 15:11:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:12,757 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-12 15:11:12,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:11:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-01-12 15:11:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 15:11:12,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:12,760 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] [2019-01-12 15:11:12,760 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-01-12 15:11:12,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:12,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:12,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:11:12,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:12,866 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 [2019-01-12 15:11:12,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:12,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:13,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:13,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-12 15:11:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:11:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:11:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:11:13,067 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2019-01-12 15:11:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:13,449 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 15:11:13,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:11:13,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 15:11:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:13,454 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:11:13,454 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:11:13,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:11:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:11:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:11:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:11:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-12 15:11:13,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2019-01-12 15:11:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:13,465 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-12 15:11:13,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:11:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-01-12 15:11:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:11:13,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:13,468 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] [2019-01-12 15:11:13,468 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-01-12 15:11:13,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:11:13,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:13,580 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 [2019-01-12 15:11:13,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:13,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:11:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:13,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2019-01-12 15:11:13,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:11:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:11:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:11:13,711 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2019-01-12 15:11:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:13,977 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2019-01-12 15:11:13,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:11:13,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-12 15:11:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:13,980 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:11:13,980 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:11:13,984 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 [2019-01-12 15:11:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:11:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2019-01-12 15:11:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 15:11:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-01-12 15:11:13,996 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2019-01-12 15:11:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:13,997 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-01-12 15:11:13,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:11:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-01-12 15:11:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 15:11:14,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:14,000 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] [2019-01-12 15:11:14,000 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-01-12 15:11:14,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:14,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 15:11:14,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:14,240 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 [2019-01-12 15:11:14,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:14,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 15:11:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-12 15:11:14,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:11:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:11:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:14,382 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 9 states. [2019-01-12 15:11:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:14,548 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2019-01-12 15:11:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:11:14,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-01-12 15:11:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:14,551 INFO L225 Difference]: With dead ends: 62 [2019-01-12 15:11:14,551 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 15:11:14,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:11:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 15:11:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-01-12 15:11:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 15:11:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-01-12 15:11:14,563 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 50 [2019-01-12 15:11:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:14,564 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-01-12 15:11:14,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:11:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-01-12 15:11:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:11:14,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:14,567 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:14,567 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash -26046796, now seen corresponding path program 1 times [2019-01-12 15:11:14,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:14,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:14,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 15:11:15,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:15,192 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 [2019-01-12 15:11:15,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:15,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 15:11:15,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:15,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2019-01-12 15:11:15,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:11:15,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:11:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:11:15,597 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 21 states. [2019-01-12 15:11:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:16,096 INFO L93 Difference]: Finished difference Result 78 states and 136 transitions. [2019-01-12 15:11:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:11:16,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-01-12 15:11:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:16,100 INFO L225 Difference]: With dead ends: 78 [2019-01-12 15:11:16,100 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 15:11:16,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:11:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 15:11:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2019-01-12 15:11:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 15:11:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2019-01-12 15:11:16,128 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 64 [2019-01-12 15:11:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:16,129 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2019-01-12 15:11:16,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:11:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2019-01-12 15:11:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 15:11:16,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:16,143 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:16,143 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1229433553, now seen corresponding path program 2 times [2019-01-12 15:11:16,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:16,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:16,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:16,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 46 proven. 15 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-01-12 15:11:16,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:16,379 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 [2019-01-12 15:11:16,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:16,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:16,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:16,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 15:11:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-01-12 15:11:16,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:11:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:11:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:16,769 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 12 states. [2019-01-12 15:11:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:17,026 INFO L93 Difference]: Finished difference Result 70 states and 121 transitions. [2019-01-12 15:11:17,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:11:17,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2019-01-12 15:11:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:17,030 INFO L225 Difference]: With dead ends: 70 [2019-01-12 15:11:17,031 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 15:11:17,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 15:11:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2019-01-12 15:11:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:11:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2019-01-12 15:11:17,048 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 78 [2019-01-12 15:11:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:17,048 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 85 transitions. [2019-01-12 15:11:17,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:11:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2019-01-12 15:11:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 15:11:17,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:17,053 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:17,053 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash -33377407, now seen corresponding path program 1 times [2019-01-12 15:11:17,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:17,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:17,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:17,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:17,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-12 15:11:17,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:17,335 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 [2019-01-12 15:11:17,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:17,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-12 15:11:17,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:17,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:11:17,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:11:17,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:11:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:17,464 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand 9 states. [2019-01-12 15:11:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:17,778 INFO L93 Difference]: Finished difference Result 78 states and 147 transitions. [2019-01-12 15:11:17,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:11:17,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-01-12 15:11:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:17,780 INFO L225 Difference]: With dead ends: 78 [2019-01-12 15:11:17,780 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:11:17,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:11:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:11:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:11:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:11:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2019-01-12 15:11:17,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 65 [2019-01-12 15:11:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:17,790 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2019-01-12 15:11:17,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:11:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2019-01-12 15:11:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 15:11:17,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:17,792 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, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:17,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash -373696391, now seen corresponding path program 3 times [2019-01-12 15:11:17,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:17,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:17,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-01-12 15:11:17,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:17,887 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 [2019-01-12 15:11:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:11:17,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-12 15:11:17,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:17,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-01-12 15:11:18,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:18,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:11:18,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:11:18,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:11:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:11:18,025 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand 7 states. [2019-01-12 15:11:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:18,664 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2019-01-12 15:11:18,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:18,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-12 15:11:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:18,666 INFO L225 Difference]: With dead ends: 109 [2019-01-12 15:11:18,666 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 15:11:18,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:11:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 15:11:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-01-12 15:11:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-12 15:11:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2019-01-12 15:11:18,675 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 91 [2019-01-12 15:11:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:18,675 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2019-01-12 15:11:18,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:11:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2019-01-12 15:11:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 15:11:18,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:18,677 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:18,677 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1234144971, now seen corresponding path program 4 times [2019-01-12 15:11:18,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:18,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:18,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 84 proven. 37 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-12 15:11:18,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:18,843 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 [2019-01-12 15:11:18,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:11:18,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:11:18,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:18,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 50 proven. 44 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-01-12 15:11:19,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:19,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-01-12 15:11:19,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:11:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:11:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:19,084 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 14 states. [2019-01-12 15:11:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:19,313 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2019-01-12 15:11:19,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:11:19,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2019-01-12 15:11:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:19,315 INFO L225 Difference]: With dead ends: 100 [2019-01-12 15:11:19,315 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:11:19,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:11:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:11:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:11:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:11:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:11:19,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-01-12 15:11:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:19,317 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:11:19,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:11:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:11:19,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:11:19,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:11:19,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:19,744 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 15:11:20,080 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-01-12 15:11:20,497 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-01-12 15:11:20,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:11:20,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:11:20,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:11:20,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-01-12 15:11:20,510 INFO L444 ceAbstractionStarter]: At program point L41(lines 35 42) the Hoare annotation is: (<= 4 ULTIMATE.start_main_~x~0) [2019-01-12 15:11:20,510 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 15:11:20,510 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-01-12 15:11:20,511 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 4) (<= 4 ULTIMATE.start_main_~x~0)) [2019-01-12 15:11:20,511 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-01-12 15:11:20,511 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-01-12 15:11:20,511 INFO L451 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-01-12 15:11:20,512 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (<= 2 fibo2_~n) (<= |fibo2_#in~n| fibo2_~n)) [2019-01-12 15:11:20,512 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-12 15:11:20,512 INFO L444 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (<= 2 fibo2_~n) (<= |fibo2_#in~n| fibo2_~n) (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1)) (<= 4 |fibo2_#in~n|))) [2019-01-12 15:11:20,512 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-01-12 15:11:20,512 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-01-12 15:11:20,512 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-01-12 15:11:20,512 INFO L448 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-01-12 15:11:20,512 INFO L448 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-01-12 15:11:20,512 INFO L451 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-01-12 15:11:20,513 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (< 1 fibo1_~n) (<= |fibo1_#in~n| fibo1_~n)) [2019-01-12 15:11:20,513 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-01-12 15:11:20,513 INFO L444 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (or (<= 5 |fibo1_#in~n|) (or (<= |fibo1_#in~n| 3) (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2)))) (or (<= 3 fibo1_~n) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))) (< 1 fibo1_~n) (<= |fibo1_#in~n| fibo1_~n)) [2019-01-12 15:11:20,513 INFO L448 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-01-12 15:11:20,513 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-01-12 15:11:20,513 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-01-12 15:11:20,513 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-01-12 15:11:20,513 INFO L448 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-01-12 15:11:20,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:11:20 BoogieIcfgContainer [2019-01-12 15:11:20,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:11:20,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:11:20,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:11:20,528 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:11:20,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:09" (3/4) ... [2019-01-12 15:11:20,532 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:11:20,538 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-01-12 15:11:20,538 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-01-12 15:11:20,544 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:11:20,544 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:11:20,600 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:11:20,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:11:20,601 INFO L168 Benchmark]: Toolchain (without parser) took 11463.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -294.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:20,602 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:20,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:20,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.96 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:20,607 INFO L168 Benchmark]: Boogie Preprocessor took 15.37 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:20,608 INFO L168 Benchmark]: RCFGBuilder took 490.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 937.9 MB in the beginning and 1.0 GB in the end (delta: -108.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:20,612 INFO L168 Benchmark]: TraceAbstraction took 10543.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.1 MB). Peak memory consumption was 413.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:20,613 INFO L168 Benchmark]: Witness Printer took 72.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:20,619 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 29.96 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.37 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 490.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 937.9 MB in the beginning and 1.0 GB in the end (delta: -108.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10543.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.1 MB). Peak memory consumption was 413.4 MB. Max. memory is 11.5 GB. * Witness Printer took 72.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 4 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. SAFE Result, 10.4s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 219 SDslu, 1664 SDs, 0 SdLazy, 1353 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 569 SyntacticMatches, 9 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 113 PreInvPairs, 238 NumberOfFragments, 90 HoareAnnotationTreeSize, 113 FomulaSimplifications, 5424 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 438 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1133 ConstructedInterpolants, 0 QuantifiedInterpolants, 143701 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1203 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1332/1656 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...