./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_5_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:57:53,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:57:53,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:57:54,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:57:54,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:57:54,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:57:54,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:57:54,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:57:54,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:57:54,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:57:54,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:57:54,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:57:54,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:57:54,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:57:54,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:57:54,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:57:54,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:57:54,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:57:54,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:57:54,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:57:54,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:57:54,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:57:54,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:57:54,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:57:54,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:57:54,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:57:54,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:57:54,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:57:54,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:57:54,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:57:54,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:57:54,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:57:54,063 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:57:54,063 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:57:54,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:57:54,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:57:54,069 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:57:54,094 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:57:54,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:57:54,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:57:54,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:57:54,096 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:57:54,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:57:54,097 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:57:54,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:57:54,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:57:54,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:57:54,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:57:54,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:57:54,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:57:54,098 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:57:54,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:57:54,098 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:57:54,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:57:54,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:57:54,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:57:54,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:57:54,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:57:54,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:57:54,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:57:54,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:57:54,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:57:54,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:57:54,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:57:54,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:57:54,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe571d33601eb001defa960d70b02ea99b59263c [2019-01-12 14:57:54,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:57:54,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:57:54,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:57:54,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:57:54,162 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:57:54,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2019-01-12 14:57:54,226 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9354d05d9/6e5f66be4e9d495dbcb19025f593c585/FLAGa74a3bd87 [2019-01-12 14:57:54,688 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:57:54,689 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2019-01-12 14:57:54,695 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9354d05d9/6e5f66be4e9d495dbcb19025f593c585/FLAGa74a3bd87 [2019-01-12 14:57:54,711 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9354d05d9/6e5f66be4e9d495dbcb19025f593c585 [2019-01-12 14:57:54,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:57:54,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:57:54,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:57:54,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:57:54,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:57:54,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54, skipping insertion in model container [2019-01-12 14:57:54,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:57:54,749 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:57:54,892 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:57:54,897 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:57:54,915 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:57:54,930 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:57:54,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54 WrapperNode [2019-01-12 14:57:54,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:57:54,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:57:54,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:57:54,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:57:54,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:57:54,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:57:54,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:57:54,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:57:54,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (1/1) ... [2019-01-12 14:57:54,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:57:54,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:57:54,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:57:54,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:57:54,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (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 14:57:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:57:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:57:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-12 14:57:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-12 14:57:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-12 14:57:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-12 14:57:55,453 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:57:55,453 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:57:55,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:55 BoogieIcfgContainer [2019-01-12 14:57:55,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:57:55,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:57:55,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:57:55,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:57:55,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:57:54" (1/3) ... [2019-01-12 14:57:55,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18670e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:57:55, skipping insertion in model container [2019-01-12 14:57:55,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:54" (2/3) ... [2019-01-12 14:57:55,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18670e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:57:55, skipping insertion in model container [2019-01-12 14:57:55,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:55" (3/3) ... [2019-01-12 14:57:55,463 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2019-01-12 14:57:55,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:57:55,481 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:57:55,496 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:57:55,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:57:55,530 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:57:55,530 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:57:55,530 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:57:55,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:57:55,531 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:57:55,531 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:57:55,531 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:57:55,531 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:57:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 14:57:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:57:55,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:55,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:55,562 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-01-12 14:57:55,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:55,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:55,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:55,759 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 14:57:55,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:57:55,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:57:55,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:57:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:57:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:57:55,779 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-01-12 14:57:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:56,164 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-01-12 14:57:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:57:56,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:57:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:56,177 INFO L225 Difference]: With dead ends: 38 [2019-01-12 14:57:56,177 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:57:56,180 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 14:57:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:57:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:57:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:57:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 14:57:56,223 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-01-12 14:57:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:56,223 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 14:57:56,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:57:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 14:57:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:57:56,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:56,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:56,226 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:56,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-01-12 14:57:56,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:56,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:56,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:56,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:56,316 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 14:57:56,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:57:56,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:57:56,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:57:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:57:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:57:56,320 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-01-12 14:57:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:56,652 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-01-12 14:57:56,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:57:56,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:57:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:56,655 INFO L225 Difference]: With dead ends: 32 [2019-01-12 14:57:56,655 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 14:57:56,656 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 14:57:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 14:57:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 14:57:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:57:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 14:57:56,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-01-12 14:57:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:56,666 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 14:57:56,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:57:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 14:57:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:57:56,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:56,668 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 14:57:56,668 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-01-12 14:57:56,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:56,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:56,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:56,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:56,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:56,819 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 14:57:56,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:56,820 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 14:57:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:56,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:56,985 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 14:57:57,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:57,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 14:57:57,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:57:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:57:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:57,010 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2019-01-12 14:57:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:57,677 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2019-01-12 14:57:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:57,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-12 14:57:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:57,680 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:57:57,680 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 14:57:57,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:57:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 14:57:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-12 14:57:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 14:57:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 14:57:57,700 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2019-01-12 14:57:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:57,700 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 14:57:57,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:57:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 14:57:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:57:57,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:57,705 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 14:57:57,708 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-01-12 14:57:57,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:57,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:57,887 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 14:57:57,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:57,888 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 14:57:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:57,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:57,935 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 14:57:57,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:57,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:57:57,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:57:57,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:57:57,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:57:57,955 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2019-01-12 14:57:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:58,237 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-01-12 14:57:58,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:57:58,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 14:57:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:58,241 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:57:58,241 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:57:58,242 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 14:57:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:57:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-12 14:57:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 14:57:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-01-12 14:57:58,252 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2019-01-12 14:57:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:58,253 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-12 14:57:58,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:57:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-01-12 14:57:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:57:58,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:58,256 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 14:57:58,256 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-01-12 14:57:58,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:58,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:58,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:58,362 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 14:57:58,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:58,362 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 14:57:58,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:58,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:58,506 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 14:57:58,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:58,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-12 14:57:58,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:58,532 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2019-01-12 14:57:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:58,900 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 14:57:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:57:58,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 14:57:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:58,904 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:57:58,904 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:57:58,905 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 14:57:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:57:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:57:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:57:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-12 14:57:58,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2019-01-12 14:57:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:58,915 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-12 14:57:58,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-01-12 14:57:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:57:58,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:58,918 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 14:57:58,918 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-01-12 14:57:58,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:58,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:58,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:59,000 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 14:57:59,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:59,000 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 14:57:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:59,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:59,088 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 14:57:59,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:59,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2019-01-12 14:57:59,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:59,120 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2019-01-12 14:57:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:59,376 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2019-01-12 14:57:59,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:59,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-12 14:57:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:59,380 INFO L225 Difference]: With dead ends: 57 [2019-01-12 14:57:59,380 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:57:59,381 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 14:57:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:57:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2019-01-12 14:57:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 14:57:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-01-12 14:57:59,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2019-01-12 14:57:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:59,396 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-01-12 14:57:59,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-01-12 14:57:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:57:59,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:59,400 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 14:57:59,401 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-01-12 14:57:59,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:59,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:59,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:59,518 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 14:57:59,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:59,519 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 14:57:59,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:59,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 14:57:59,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:59,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-01-12 14:57:59,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:59,661 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 10 states. [2019-01-12 14:58:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:00,076 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2019-01-12 14:58:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:58:00,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-01-12 14:58:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:00,080 INFO L225 Difference]: With dead ends: 67 [2019-01-12 14:58:00,080 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 14:58:00,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:58:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 14:58:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-01-12 14:58:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:58:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-01-12 14:58:00,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 50 [2019-01-12 14:58:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:00,099 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-01-12 14:58:00,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:58:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-01-12 14:58:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 14:58:00,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:00,104 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:00,105 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1353550601, now seen corresponding path program 2 times [2019-01-12 14:58:00,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:00,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:00,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 14:58:00,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:00,400 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 14:58:00,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:00,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:00,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:00,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-12 14:58:00,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:00,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-01-12 14:58:00,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 14:58:00,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 14:58:00,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:58:00,637 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 14 states. [2019-01-12 14:58:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:01,232 INFO L93 Difference]: Finished difference Result 123 states and 234 transitions. [2019-01-12 14:58:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:58:01,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-01-12 14:58:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:01,236 INFO L225 Difference]: With dead ends: 123 [2019-01-12 14:58:01,236 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 14:58:01,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:58:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 14:58:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-12 14:58:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-12 14:58:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 97 transitions. [2019-01-12 14:58:01,256 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 97 transitions. Word has length 76 [2019-01-12 14:58:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:01,256 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 97 transitions. [2019-01-12 14:58:01,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 14:58:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 97 transitions. [2019-01-12 14:58:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 14:58:01,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:01,261 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:01,261 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1328267489, now seen corresponding path program 1 times [2019-01-12 14:58:01,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:01,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-12 14:58:01,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:01,492 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 14:58:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:01,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 30 proven. 41 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-01-12 14:58:01,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:01,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-01-12 14:58:01,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:58:01,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:58:01,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:58:01,700 INFO L87 Difference]: Start difference. First operand 61 states and 97 transitions. Second operand 15 states. [2019-01-12 14:58:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:02,579 INFO L93 Difference]: Finished difference Result 176 states and 345 transitions. [2019-01-12 14:58:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 14:58:02,580 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-01-12 14:58:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:02,584 INFO L225 Difference]: With dead ends: 176 [2019-01-12 14:58:02,585 INFO L226 Difference]: Without dead ends: 111 [2019-01-12 14:58:02,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:58:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-12 14:58:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2019-01-12 14:58:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-12 14:58:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 155 transitions. [2019-01-12 14:58:02,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 155 transitions. Word has length 91 [2019-01-12 14:58:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:02,609 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 155 transitions. [2019-01-12 14:58:02,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:58:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 155 transitions. [2019-01-12 14:58:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 14:58:02,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:02,613 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:02,614 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1985146669, now seen corresponding path program 2 times [2019-01-12 14:58:02,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:02,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:02,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-01-12 14:58:02,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:02,897 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 14:58:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:02,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:02,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:02,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-12 14:58:03,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:03,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2019-01-12 14:58:03,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:58:03,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:58:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:58:03,074 INFO L87 Difference]: Start difference. First operand 93 states and 155 transitions. Second operand 15 states. [2019-01-12 14:58:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:04,633 INFO L93 Difference]: Finished difference Result 249 states and 500 transitions. [2019-01-12 14:58:04,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 14:58:04,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-01-12 14:58:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:04,638 INFO L225 Difference]: With dead ends: 249 [2019-01-12 14:58:04,638 INFO L226 Difference]: Without dead ends: 162 [2019-01-12 14:58:04,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-01-12 14:58:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-12 14:58:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2019-01-12 14:58:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 14:58:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 271 transitions. [2019-01-12 14:58:04,671 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 271 transitions. Word has length 78 [2019-01-12 14:58:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:04,672 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 271 transitions. [2019-01-12 14:58:04,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:58:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 271 transitions. [2019-01-12 14:58:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 14:58:04,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:04,677 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:04,677 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash -704583867, now seen corresponding path program 3 times [2019-01-12 14:58:04,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:04,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:04,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:58:04,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:04,969 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 14:58:04,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:05,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 14:58:05,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:05,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:58:05,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:05,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:58:05,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:58:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:58:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:58:05,070 INFO L87 Difference]: Start difference. First operand 150 states and 271 transitions. Second operand 7 states. [2019-01-12 14:58:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:05,291 INFO L93 Difference]: Finished difference Result 305 states and 614 transitions. [2019-01-12 14:58:05,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:58:05,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-01-12 14:58:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:05,299 INFO L225 Difference]: With dead ends: 305 [2019-01-12 14:58:05,299 INFO L226 Difference]: Without dead ends: 163 [2019-01-12 14:58:05,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:58:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-12 14:58:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2019-01-12 14:58:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 14:58:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 274 transitions. [2019-01-12 14:58:05,355 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 274 transitions. Word has length 106 [2019-01-12 14:58:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:05,359 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 274 transitions. [2019-01-12 14:58:05,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:58:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 274 transitions. [2019-01-12 14:58:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 14:58:05,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:05,364 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:05,364 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash -265094421, now seen corresponding path program 1 times [2019-01-12 14:58:05,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:05,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:05,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-01-12 14:58:05,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:05,727 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 14:58:05,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:05,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-12 14:58:05,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:05,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2019-01-12 14:58:05,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 14:58:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 14:58:05,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:58:05,923 INFO L87 Difference]: Start difference. First operand 152 states and 274 transitions. Second operand 12 states. [2019-01-12 14:58:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:06,784 INFO L93 Difference]: Finished difference Result 304 states and 624 transitions. [2019-01-12 14:58:06,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:58:06,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 106 [2019-01-12 14:58:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:06,789 INFO L225 Difference]: With dead ends: 304 [2019-01-12 14:58:06,789 INFO L226 Difference]: Without dead ends: 105 [2019-01-12 14:58:06,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-01-12 14:58:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-12 14:58:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-01-12 14:58:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 14:58:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2019-01-12 14:58:06,807 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 106 [2019-01-12 14:58:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:06,808 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2019-01-12 14:58:06,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 14:58:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2019-01-12 14:58:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 14:58:06,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:06,812 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:06,813 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1882786525, now seen corresponding path program 2 times [2019-01-12 14:58:06,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:06,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:06,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-01-12 14:58:06,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:06,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:07,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:07,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:07,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:07,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-01-12 14:58:07,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:07,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 14:58:07,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:58:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:58:07,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:58:07,100 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand 8 states. [2019-01-12 14:58:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:07,247 INFO L93 Difference]: Finished difference Result 120 states and 175 transitions. [2019-01-12 14:58:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:58:07,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-01-12 14:58:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:07,251 INFO L225 Difference]: With dead ends: 120 [2019-01-12 14:58:07,251 INFO L226 Difference]: Without dead ends: 116 [2019-01-12 14:58:07,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:58:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-12 14:58:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2019-01-12 14:58:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 14:58:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2019-01-12 14:58:07,266 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 91 [2019-01-12 14:58:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:07,266 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2019-01-12 14:58:07,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:58:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2019-01-12 14:58:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 14:58:07,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:07,268 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:07,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1335172610, now seen corresponding path program 3 times [2019-01-12 14:58:07,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:07,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:07,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:58:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:58:07,325 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:58:07,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:58:07 BoogieIcfgContainer [2019-01-12 14:58:07,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:58:07,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:58:07,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:58:07,389 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:58:07,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:55" (3/4) ... [2019-01-12 14:58:07,395 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:58:07,504 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:58:07,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:58:07,505 INFO L168 Benchmark]: Toolchain (without parser) took 12789.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -101.8 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:07,510 INFO L168 Benchmark]: CDTParser took 0.16 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 14:58:07,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.37 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:07,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:07,511 INFO L168 Benchmark]: Boogie Preprocessor took 14.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:07,511 INFO L168 Benchmark]: RCFGBuilder took 476.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:07,516 INFO L168 Benchmark]: TraceAbstraction took 11931.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.6 MB). Peak memory consumption was 215.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:07,516 INFO L168 Benchmark]: Witness Printer took 115.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:07,521 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.16 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 213.37 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 476.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11931.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.6 MB). Peak memory consumption was 215.4 MB. Max. memory is 11.5 GB. * Witness Printer took 115.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 5 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. UNSAFE Result, 11.8s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 404 SDslu, 1518 SDs, 0 SdLazy, 2391 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 716 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 107 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1423 ConstructedInterpolants, 0 QuantifiedInterpolants, 166495 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1466 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 2160/2558 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...