./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 595c6555624af5bbcf79585a20acb2500e3eeee8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:06:33,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:06:33,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:06:33,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:06:33,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:06:33,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:06:33,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:06:33,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:06:33,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:06:33,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:06:33,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:06:33,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:06:33,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:06:33,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:06:33,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:06:33,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:06:33,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:06:33,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:06:33,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:06:33,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:06:33,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:06:33,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:06:33,081 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:06:33,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:06:33,081 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:06:33,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:06:33,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:06:33,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:06:33,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:06:33,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:06:33,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:06:33,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:06:33,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:06:33,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:06:33,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:06:33,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:06:33,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:06:33,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:06:33,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:06:33,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:06:33,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:06:33,111 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:06:33,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:06:33,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:06:33,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:06:33,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:06:33,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:06:33,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:06:33,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:06:33,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:06:33,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:06:33,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:06:33,114 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:06:33,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:06:33,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:06:33,115 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:06:33,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:06:33,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:06:33,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:06:33,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:06:33,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:06:33,116 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:06:33,117 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:06:33,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:06:33,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:06:33,117 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 -> 595c6555624af5bbcf79585a20acb2500e3eeee8 [2018-12-31 10:06:33,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:06:33,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:06:33,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:06:33,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:06:33,179 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:06:33,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c [2018-12-31 10:06:33,241 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caba971f1/764dd63914294e4caa01c13ef4d3b267/FLAG55e2d07b6 [2018-12-31 10:06:33,760 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:06:33,761 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c [2018-12-31 10:06:33,767 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caba971f1/764dd63914294e4caa01c13ef4d3b267/FLAG55e2d07b6 [2018-12-31 10:06:34,078 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caba971f1/764dd63914294e4caa01c13ef4d3b267 [2018-12-31 10:06:34,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:06:34,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:06:34,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:06:34,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:06:34,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:06:34,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a92d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34, skipping insertion in model container [2018-12-31 10:06:34,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:06:34,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:06:34,309 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:06:34,314 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:06:34,331 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:06:34,347 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:06:34,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34 WrapperNode [2018-12-31 10:06:34,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:06:34,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:06:34,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:06:34,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:06:34,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:06:34,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:06:34,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:06:34,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:06:34,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... [2018-12-31 10:06:34,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:06:34,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:06:34,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:06:34,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:06:34,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:06:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:06:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:06:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-31 10:06:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-31 10:06:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-31 10:06:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-31 10:06:34,960 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:06:34,961 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 10:06:34,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:06:34 BoogieIcfgContainer [2018-12-31 10:06:34,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:06:34,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:06:34,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:06:34,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:06:34,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:06:34" (1/3) ... [2018-12-31 10:06:34,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be75d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:06:34, skipping insertion in model container [2018-12-31 10:06:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:34" (2/3) ... [2018-12-31 10:06:34,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be75d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:06:34, skipping insertion in model container [2018-12-31 10:06:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:06:34" (3/3) ... [2018-12-31 10:06:34,972 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_true-unreach-call_true-termination.c [2018-12-31 10:06:34,981 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:06:34,988 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:06:35,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:06:35,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:06:35,047 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:06:35,047 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:06:35,047 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:06:35,047 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:06:35,047 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:06:35,047 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:06:35,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:06:35,048 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:06:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 10:06:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 10:06:35,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:35,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:35,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:35,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2018-12-31 10:06:35,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:35,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:35,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:06:35,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:06:35,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:06:35,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:06:35,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:06:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:06:35,320 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-31 10:06:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:35,482 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-12-31 10:06:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:06:35,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 10:06:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:35,494 INFO L225 Difference]: With dead ends: 38 [2018-12-31 10:06:35,495 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 10:06:35,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:06:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 10:06:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 10:06:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:06:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 10:06:35,550 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2018-12-31 10:06:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:35,550 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 10:06:35,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:06:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 10:06:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 10:06:35,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:35,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:35,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:35,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2018-12-31 10:06:35,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:35,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:35,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:06:35,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:06:35,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:06:35,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:06:35,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:06:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:06:35,811 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2018-12-31 10:06:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:36,190 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-12-31 10:06:36,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:06:36,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 10:06:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:36,192 INFO L225 Difference]: With dead ends: 32 [2018-12-31 10:06:36,193 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 10:06:36,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:06:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 10:06:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 10:06:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:06:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 10:06:36,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2018-12-31 10:06:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:36,202 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 10:06:36,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:06:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 10:06:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 10:06:36,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:36,204 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:36,205 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2018-12-31 10:06:36,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:36,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:36,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:36,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:36,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:36,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:36,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:36,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:36,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-31 10:06:36,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 10:06:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 10:06:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:06:36,565 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2018-12-31 10:06:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:37,288 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2018-12-31 10:06:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:06:37,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-31 10:06:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:37,292 INFO L225 Difference]: With dead ends: 54 [2018-12-31 10:06:37,292 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 10:06:37,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:06:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 10:06:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-31 10:06:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 10:06:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 10:06:37,303 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2018-12-31 10:06:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:37,304 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 10:06:37,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 10:06:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 10:06:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:06:37,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:37,306 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:37,307 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2018-12-31 10:06:37,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:37,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:37,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:37,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:37,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:37,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:37,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:37,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:37,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 10:06:37,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:06:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:06:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:06:37,655 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-12-31 10:06:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:37,895 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2018-12-31 10:06:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 10:06:37,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 10:06:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:37,900 INFO L225 Difference]: With dead ends: 39 [2018-12-31 10:06:37,900 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 10:06:37,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:06:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 10:06:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-31 10:06:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 10:06:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-31 10:06:37,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2018-12-31 10:06:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:37,915 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-31 10:06:37,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:06:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-31 10:06:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 10:06:37,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:37,917 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:37,917 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2018-12-31 10:06:37,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:37,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:37,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 10:06:38,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:38,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:38,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:06:38,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:38,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-31 10:06:38,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:06:38,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:06:38,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:06:38,233 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2018-12-31 10:06:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:38,587 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2018-12-31 10:06:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:06:38,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-31 10:06:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:38,591 INFO L225 Difference]: With dead ends: 66 [2018-12-31 10:06:38,591 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 10:06:38,592 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 [2018-12-31 10:06:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 10:06:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 10:06:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 10:06:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-12-31 10:06:38,604 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2018-12-31 10:06:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:38,605 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-12-31 10:06:38,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:06:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2018-12-31 10:06:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 10:06:38,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:38,607 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:38,607 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2018-12-31 10:06:38,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:06:38,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:38,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:38,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:38,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 10:06:38,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-31 10:06:38,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:06:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:06:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:06:38,845 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2018-12-31 10:06:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:39,148 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-12-31 10:06:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:06:39,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-31 10:06:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:39,152 INFO L225 Difference]: With dead ends: 57 [2018-12-31 10:06:39,152 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 10:06:39,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:06:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 10:06:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-12-31 10:06:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 10:06:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-12-31 10:06:39,167 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2018-12-31 10:06:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:39,168 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-31 10:06:39,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:06:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2018-12-31 10:06:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 10:06:39,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:39,172 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:39,172 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2018-12-31 10:06:39,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:39,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 10:06:39,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:39,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:39,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-31 10:06:39,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:39,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-31 10:06:39,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:06:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:06:39,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:06:39,441 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 10 states. [2018-12-31 10:06:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:39,935 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2018-12-31 10:06:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:06:39,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-12-31 10:06:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:39,938 INFO L225 Difference]: With dead ends: 67 [2018-12-31 10:06:39,939 INFO L226 Difference]: Without dead ends: 63 [2018-12-31 10:06:39,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:06:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-31 10:06:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2018-12-31 10:06:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 10:06:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2018-12-31 10:06:39,954 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 50 [2018-12-31 10:06:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:39,955 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2018-12-31 10:06:39,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:06:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2018-12-31 10:06:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 10:06:39,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:39,959 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:39,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1353550601, now seen corresponding path program 2 times [2018-12-31 10:06:39,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 10:06:40,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:40,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:06:40,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:06:40,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:40,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-31 10:06:40,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:40,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-31 10:06:40,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 10:06:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 10:06:40,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:06:40,651 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 16 states. [2018-12-31 10:06:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:41,598 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2018-12-31 10:06:41,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 10:06:41,599 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-12-31 10:06:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:41,604 INFO L225 Difference]: With dead ends: 142 [2018-12-31 10:06:41,607 INFO L226 Difference]: Without dead ends: 99 [2018-12-31 10:06:41,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-12-31 10:06:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-31 10:06:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2018-12-31 10:06:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-31 10:06:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 153 transitions. [2018-12-31 10:06:41,655 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 153 transitions. Word has length 76 [2018-12-31 10:06:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:41,655 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 153 transitions. [2018-12-31 10:06:41,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 10:06:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 153 transitions. [2018-12-31 10:06:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-31 10:06:41,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:41,665 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:41,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:41,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2005756209, now seen corresponding path program 1 times [2018-12-31 10:06:41,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:41,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:41,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 77 proven. 154 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-12-31 10:06:41,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:41,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:41,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:42,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 53 proven. 175 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2018-12-31 10:06:43,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:43,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-31 10:06:43,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 10:06:43,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 10:06:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:06:43,057 INFO L87 Difference]: Start difference. First operand 83 states and 153 transitions. Second operand 18 states. [2018-12-31 10:06:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:44,795 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2018-12-31 10:06:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 10:06:44,796 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 158 [2018-12-31 10:06:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:44,799 INFO L225 Difference]: With dead ends: 235 [2018-12-31 10:06:44,800 INFO L226 Difference]: Without dead ends: 154 [2018-12-31 10:06:44,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2018-12-31 10:06:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-31 10:06:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2018-12-31 10:06:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-31 10:06:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 239 transitions. [2018-12-31 10:06:44,832 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 239 transitions. Word has length 158 [2018-12-31 10:06:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:44,833 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 239 transitions. [2018-12-31 10:06:44,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 10:06:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 239 transitions. [2018-12-31 10:06:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-31 10:06:44,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:44,839 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 18, 15, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:44,839 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 603145169, now seen corresponding path program 2 times [2018-12-31 10:06:44,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 145 proven. 235 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2018-12-31 10:06:45,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:45,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:45,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:06:45,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:06:45,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:45,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 139 proven. 348 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2018-12-31 10:06:45,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:45,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-12-31 10:06:45,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 10:06:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 10:06:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:06:45,719 INFO L87 Difference]: Start difference. First operand 135 states and 239 transitions. Second operand 13 states. [2018-12-31 10:06:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:46,583 INFO L93 Difference]: Finished difference Result 274 states and 559 transitions. [2018-12-31 10:06:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 10:06:46,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 270 [2018-12-31 10:06:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:46,588 INFO L225 Difference]: With dead ends: 274 [2018-12-31 10:06:46,588 INFO L226 Difference]: Without dead ends: 102 [2018-12-31 10:06:46,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-12-31 10:06:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-31 10:06:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-12-31 10:06:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-31 10:06:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2018-12-31 10:06:46,607 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 270 [2018-12-31 10:06:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:46,608 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2018-12-31 10:06:46,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 10:06:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2018-12-31 10:06:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-31 10:06:46,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:46,610 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:46,610 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 3 times [2018-12-31 10:06:46,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:46,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-31 10:06:46,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:46,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:06:46,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 10:06:46,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:46,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-12-31 10:06:46,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:46,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-12-31 10:06:46,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:06:46,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:06:46,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:06:46,883 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand 10 states. [2018-12-31 10:06:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:47,592 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-12-31 10:06:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:06:47,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-12-31 10:06:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:47,597 INFO L225 Difference]: With dead ends: 103 [2018-12-31 10:06:47,598 INFO L226 Difference]: Without dead ends: 96 [2018-12-31 10:06:47,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:06:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-31 10:06:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-31 10:06:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 10:06:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-12-31 10:06:47,630 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 146 [2018-12-31 10:06:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:47,631 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-12-31 10:06:47,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:06:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2018-12-31 10:06:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-31 10:06:47,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:47,641 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:47,641 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash -981199599, now seen corresponding path program 4 times [2018-12-31 10:06:47,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:47,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:47,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 217 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-12-31 10:06:48,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:48,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:48,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 10:06:48,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 10:06:48,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:48,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 89 proven. 150 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-12-31 10:06:48,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:48,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-12-31 10:06:48,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 10:06:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 10:06:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-12-31 10:06:48,595 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 20 states. [2018-12-31 10:06:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:49,880 INFO L93 Difference]: Finished difference Result 220 states and 337 transitions. [2018-12-31 10:06:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 10:06:49,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 186 [2018-12-31 10:06:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:49,883 INFO L225 Difference]: With dead ends: 220 [2018-12-31 10:06:49,883 INFO L226 Difference]: Without dead ends: 122 [2018-12-31 10:06:49,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2018-12-31 10:06:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-31 10:06:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-12-31 10:06:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-31 10:06:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2018-12-31 10:06:49,898 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 186 [2018-12-31 10:06:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:49,899 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2018-12-31 10:06:49,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 10:06:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2018-12-31 10:06:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-31 10:06:49,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:49,903 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:49,903 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1543071082, now seen corresponding path program 5 times [2018-12-31 10:06:49,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:49,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:49,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:49,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:49,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 157 proven. 290 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2018-12-31 10:06:50,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:50,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:50,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 10:06:50,198 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-31 10:06:50,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:50,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 612 proven. 126 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-12-31 10:06:50,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:50,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2018-12-31 10:06:50,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 10:06:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 10:06:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-31 10:06:50,300 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand 17 states. [2018-12-31 10:06:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:50,998 INFO L93 Difference]: Finished difference Result 275 states and 398 transitions. [2018-12-31 10:06:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 10:06:51,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 200 [2018-12-31 10:06:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:51,007 INFO L225 Difference]: With dead ends: 275 [2018-12-31 10:06:51,007 INFO L226 Difference]: Without dead ends: 158 [2018-12-31 10:06:51,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 10:06:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-31 10:06:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2018-12-31 10:06:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-31 10:06:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2018-12-31 10:06:51,022 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 200 [2018-12-31 10:06:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:51,022 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2018-12-31 10:06:51,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 10:06:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2018-12-31 10:06:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-31 10:06:51,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:51,026 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 15, 13, 12, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:51,026 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:51,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1980274974, now seen corresponding path program 6 times [2018-12-31 10:06:51,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:51,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:51,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 110 proven. 281 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2018-12-31 10:06:51,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:51,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:51,388 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 10:06:51,426 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-12-31 10:06:51,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:51,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 564 proven. 18 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2018-12-31 10:06:51,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:51,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-12-31 10:06:51,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 10:06:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 10:06:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:06:51,582 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 13 states. [2018-12-31 10:06:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:51,978 INFO L93 Difference]: Finished difference Result 258 states and 351 transitions. [2018-12-31 10:06:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 10:06:51,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 226 [2018-12-31 10:06:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:51,982 INFO L225 Difference]: With dead ends: 258 [2018-12-31 10:06:51,982 INFO L226 Difference]: Without dead ends: 133 [2018-12-31 10:06:51,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-31 10:06:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-31 10:06:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-31 10:06:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-31 10:06:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2018-12-31 10:06:51,995 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 226 [2018-12-31 10:06:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:51,995 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2018-12-31 10:06:51,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 10:06:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2018-12-31 10:06:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-31 10:06:51,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:51,997 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:51,997 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 7 times [2018-12-31 10:06:51,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:51,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:51,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:51,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:51,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-12-31 10:06:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:53,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:53,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:53,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-12-31 10:06:54,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:54,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2018-12-31 10:06:54,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 10:06:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 10:06:54,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 10:06:54,387 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand 36 states. [2018-12-31 10:06:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:55,165 INFO L93 Difference]: Finished difference Result 161 states and 213 transitions. [2018-12-31 10:06:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 10:06:55,167 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 173 [2018-12-31 10:06:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:55,170 INFO L225 Difference]: With dead ends: 161 [2018-12-31 10:06:55,170 INFO L226 Difference]: Without dead ends: 154 [2018-12-31 10:06:55,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 177 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 10:06:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-31 10:06:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-12-31 10:06:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 10:06:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2018-12-31 10:06:55,186 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 173 [2018-12-31 10:06:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:55,187 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2018-12-31 10:06:55,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 10:06:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2018-12-31 10:06:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-31 10:06:55,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:55,189 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:55,189 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1683189046, now seen corresponding path program 8 times [2018-12-31 10:06:55,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:55,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 69 proven. 241 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-12-31 10:06:55,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:55,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:06:55,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:06:55,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:55,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 69 proven. 241 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-12-31 10:06:56,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:56,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 10:06:56,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 10:06:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 10:06:56,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:06:56,044 INFO L87 Difference]: Start difference. First operand 152 states and 204 transitions. Second operand 11 states. [2018-12-31 10:06:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:56,232 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2018-12-31 10:06:56,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:06:56,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2018-12-31 10:06:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:56,236 INFO L225 Difference]: With dead ends: 162 [2018-12-31 10:06:56,236 INFO L226 Difference]: Without dead ends: 125 [2018-12-31 10:06:56,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 10:06:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-31 10:06:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-31 10:06:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-31 10:06:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2018-12-31 10:06:56,247 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 174 [2018-12-31 10:06:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:56,252 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2018-12-31 10:06:56,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 10:06:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2018-12-31 10:06:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-31 10:06:56,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:56,254 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:56,254 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1495941360, now seen corresponding path program 9 times [2018-12-31 10:06:56,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:56,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:56,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 163 proven. 4 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2018-12-31 10:06:56,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:56,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:56,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:06:56,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-31 10:06:56,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:56,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 163 proven. 4 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2018-12-31 10:06:56,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:56,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 10:06:56,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:06:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:06:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:06:56,508 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand 7 states. [2018-12-31 10:06:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:56,609 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2018-12-31 10:06:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 10:06:56,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-12-31 10:06:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:56,611 INFO L225 Difference]: With dead ends: 135 [2018-12-31 10:06:56,611 INFO L226 Difference]: Without dead ends: 121 [2018-12-31 10:06:56,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:06:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-31 10:06:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2018-12-31 10:06:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 10:06:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2018-12-31 10:06:56,621 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 174 [2018-12-31 10:06:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:56,622 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2018-12-31 10:06:56,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:06:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-12-31 10:06:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-31 10:06:56,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:56,623 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:56,624 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1032368054, now seen corresponding path program 10 times [2018-12-31 10:06:56,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:56,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:56,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 267 proven. 35 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-12-31 10:06:57,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:57,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 10:06:57,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 10:06:57,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:57,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 211 proven. 47 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-12-31 10:06:57,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:57,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2018-12-31 10:06:57,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 10:06:57,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 10:06:57,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:06:57,367 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 18 states. [2018-12-31 10:06:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:57,962 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2018-12-31 10:06:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 10:06:57,962 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 187 [2018-12-31 10:06:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:57,964 INFO L225 Difference]: With dead ends: 152 [2018-12-31 10:06:57,964 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 10:06:57,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2018-12-31 10:06:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 10:06:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 10:06:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 10:06:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 10:06:57,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2018-12-31 10:06:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:57,966 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 10:06:57,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 10:06:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 10:06:57,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 10:06:57,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 10:06:58,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:58,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:59,592 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 49 DAG size of output: 9 [2018-12-31 10:07:01,542 WARN L181 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 72 DAG size of output: 27 [2018-12-31 10:07:01,954 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-12-31 10:07:03,543 WARN L181 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 99 DAG size of output: 24 [2018-12-31 10:07:03,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 10:07:03,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 10:07:03,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 10:07:03,547 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-12-31 10:07:03,547 INFO L444 ceAbstractionStarter]: At program point L41(lines 35 42) the Hoare annotation is: (<= 6 ULTIMATE.start_main_~x~0) [2018-12-31 10:07:03,547 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-31 10:07:03,547 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-31 10:07:03,547 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6)) [2018-12-31 10:07:03,547 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-31 10:07:03,547 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2018-12-31 10:07:03,547 INFO L451 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2018-12-31 10:07:03,548 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (< 1 |fibo2_#in~n|) (<= |fibo2_#in~n| fibo2_~n)) [2018-12-31 10:07:03,548 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-31 10:07:03,548 INFO L444 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (and (let ((.cse0 (<= |fibo2_#in~n| fibo2_~n))) (or (and (<= fibo2_~n |fibo2_#in~n|) (<= 5 |fibo2_#in~n|) .cse0) (and (<= 1 |fibo2_#t~ret2|) (<= fibo2_~n 2) (<= |fibo2_#t~ret2| 1) .cse0))) (< 1 |fibo2_#in~n|) (or (<= |fibo2_#in~n| 4) (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3)) (<= 6 |fibo2_#in~n|))) [2018-12-31 10:07:03,548 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-12-31 10:07:03,548 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-12-31 10:07:03,548 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2018-12-31 10:07:03,548 INFO L448 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2018-12-31 10:07:03,548 INFO L448 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2018-12-31 10:07:03,549 INFO L451 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2018-12-31 10:07:03,549 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (< 1 fibo1_~n) (<= |fibo1_#in~n| fibo1_~n)) [2018-12-31 10:07:03,549 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-12-31 10:07:03,549 INFO L444 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (let ((.cse0 (<= 5 |fibo1_#in~n|))) (or (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) .cse0) (and (<= |fibo1_#in~n| 5) .cse0) (<= 7 |fibo1_#in~n|) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1)))) (< 1 fibo1_~n) (<= |fibo1_#in~n| fibo1_~n)) [2018-12-31 10:07:03,549 INFO L448 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2018-12-31 10:07:03,549 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2018-12-31 10:07:03,549 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2018-12-31 10:07:03,549 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2018-12-31 10:07:03,549 INFO L448 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2018-12-31 10:07:03,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:07:03 BoogieIcfgContainer [2018-12-31 10:07:03,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:07:03,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:07:03,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:07:03,564 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:07:03,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:06:34" (3/4) ... [2018-12-31 10:07:03,568 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 10:07:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2018-12-31 10:07:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2018-12-31 10:07:03,580 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 10:07:03,580 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 10:07:03,632 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:07:03,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:07:03,633 INFO L168 Benchmark]: Toolchain (without parser) took 29549.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.7 MB). Free memory was 950.0 MB in the beginning and 1.3 GB in the end (delta: -379.3 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:03,634 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:03,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.86 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:03,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:03,636 INFO L168 Benchmark]: Boogie Preprocessor took 22.05 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:03,636 INFO L168 Benchmark]: RCFGBuilder took 551.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:03,637 INFO L168 Benchmark]: TraceAbstraction took 28599.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -242.2 MB). Peak memory consumption was 533.0 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:03,637 INFO L168 Benchmark]: Witness Printer took 69.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:03,641 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.17 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 261.86 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 39.03 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.05 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 551.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28599.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -242.2 MB). Peak memory consumption was 533.0 MB. Max. memory is 11.5 GB. * Witness Printer took 69.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 6 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. SAFE Result, 28.5s OverallTime, 18 OverallIterations, 20 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 483 SDtfs, 691 SDslu, 3850 SDs, 0 SdLazy, 4517 SolverSat, 647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2485 GetRequests, 2132 SyntacticMatches, 18 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=15, 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, 18 MinimizatonAttempts, 134 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 461 PreInvPairs, 774 NumberOfFragments, 119 HoareAnnotationTreeSize, 461 FomulaSimplifications, 13069 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3471 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 4291 NumberOfCodeBlocks, 3754 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1206581 SizeOfPredicates, 73 NumberOfNonLiveVariables, 3543 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 17114/20302 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...