./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:53:22,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:53:22,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:53:22,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:53:22,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:53:22,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:53:22,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:53:22,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:53:22,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:53:22,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:53:23,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:53:23,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:53:23,002 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:53:23,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:53:23,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:53:23,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:53:23,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:53:23,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:53:23,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:53:23,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:53:23,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:53:23,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:53:23,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:53:23,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:53:23,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:53:23,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:53:23,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:53:23,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:53:23,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:53:23,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:53:23,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:53:23,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:53:23,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:53:23,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:53:23,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:53:23,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:53:23,052 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:53:23,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:53:23,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:53:23,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:53:23,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:53:23,081 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:53:23,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:53:23,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:53:23,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:53:23,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:53:23,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:53:23,082 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:53:23,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:53:23,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:53:23,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:53:23,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:53:23,083 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:53:23,083 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:53:23,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:53:23,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:53:23,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:53:23,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:53:23,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:53:23,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:53:23,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:53:23,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:53:23,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:53:23,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:53:23,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:53:23,087 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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-12-31 09:53:23,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:53:23,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:53:23,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:53:23,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:53:23,173 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:53:23,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-31 09:53:23,243 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c294b44b/22f684b0db72438b8e430f009177eb80/FLAGa747db8a0 [2018-12-31 09:53:23,664 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:53:23,665 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-31 09:53:23,672 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c294b44b/22f684b0db72438b8e430f009177eb80/FLAGa747db8a0 [2018-12-31 09:53:24,025 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c294b44b/22f684b0db72438b8e430f009177eb80 [2018-12-31 09:53:24,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:53:24,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:53:24,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:53:24,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:53:24,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:53:24,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5f39ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24, skipping insertion in model container [2018-12-31 09:53:24,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:53:24,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:53:24,279 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:53:24,285 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:53:24,314 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:53:24,337 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:53:24,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24 WrapperNode [2018-12-31 09:53:24,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:53:24,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:53:24,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:53:24,341 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:53:24,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:53:24,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:53:24,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:53:24,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:53:24,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... [2018-12-31 09:53:24,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:53:24,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:53:24,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:53:24,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:53:24,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:53:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:53:24,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:53:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-31 09:53:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-31 09:53:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-31 09:53:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-31 09:53:24,948 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:53:24,949 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:53:24,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:24 BoogieIcfgContainer [2018-12-31 09:53:24,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:53:24,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:53:24,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:53:24,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:53:24,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:53:24" (1/3) ... [2018-12-31 09:53:24,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7a9b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:53:24, skipping insertion in model container [2018-12-31 09:53:24,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:24" (2/3) ... [2018-12-31 09:53:24,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7a9b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:53:24, skipping insertion in model container [2018-12-31 09:53:24,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:24" (3/3) ... [2018-12-31 09:53:24,960 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-31 09:53:24,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:53:24,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:53:25,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:53:25,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:53:25,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:53:25,060 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:53:25,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:53:25,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:53:25,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:53:25,061 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:53:25,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:53:25,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:53:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 09:53:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:53:25,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:25,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:25,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2018-12-31 09:53:25,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:25,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:25,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:53:25,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:53:25,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:53:25,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:53:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:53:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:53:25,392 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-31 09:53:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:25,574 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-12-31 09:53:25,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:53:25,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:53:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:25,592 INFO L225 Difference]: With dead ends: 38 [2018-12-31 09:53:25,592 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 09:53:25,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:53:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 09:53:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 09:53:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 09:53:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 09:53:25,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2018-12-31 09:53:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:25,665 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 09:53:25,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:53:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 09:53:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:53:25,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:25,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:25,670 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2018-12-31 09:53:25,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:25,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:25,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:53:25,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:53:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:53:25,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:53:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:53:25,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:53:25,798 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2018-12-31 09:53:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:26,106 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-12-31 09:53:26,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:53:26,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:53:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:26,109 INFO L225 Difference]: With dead ends: 32 [2018-12-31 09:53:26,110 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 09:53:26,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:53:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 09:53:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 09:53:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 09:53:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 09:53:26,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2018-12-31 09:53:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:26,123 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 09:53:26,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:53:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 09:53:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:53:26,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:26,125 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:26,125 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2018-12-31 09:53:26,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:26,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:26,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:26,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:26,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:26,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:26,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:26,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-31 09:53:26,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:53:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:53:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:53:26,481 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2018-12-31 09:53:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:27,191 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2018-12-31 09:53:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:27,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-31 09:53:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:27,193 INFO L225 Difference]: With dead ends: 54 [2018-12-31 09:53:27,193 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 09:53:27,195 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 09:53:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 09:53:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-31 09:53:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 09:53:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 09:53:27,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2018-12-31 09:53:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:27,204 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 09:53:27,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:53:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 09:53:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:53:27,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:27,208 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:27,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2018-12-31 09:53:27,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:27,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:27,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:27,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:27,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:27,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:27,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:27,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:53:27,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:27,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:53:27,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:53:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:53:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:53:27,524 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-12-31 09:53:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:27,762 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2018-12-31 09:53:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:53:27,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 09:53:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:27,765 INFO L225 Difference]: With dead ends: 39 [2018-12-31 09:53:27,766 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 09:53:27,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:53:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 09:53:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-31 09:53:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 09:53:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-31 09:53:27,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2018-12-31 09:53:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:27,777 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-31 09:53:27,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:53:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-31 09:53:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:53:27,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:27,780 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:27,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2018-12-31 09:53:27,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:27,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:27,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:53:27,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:27,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:27,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:53:28,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:28,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-31 09:53:28,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:28,157 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2018-12-31 09:53:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:28,506 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2018-12-31 09:53:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:53:28,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-31 09:53:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:28,510 INFO L225 Difference]: With dead ends: 66 [2018-12-31 09:53:28,510 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 09:53:28,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:53:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 09:53:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 09:53:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 09:53:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-12-31 09:53:28,521 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2018-12-31 09:53:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:28,521 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-12-31 09:53:28,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2018-12-31 09:53:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:53:28,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:28,524 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:28,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2018-12-31 09:53:28,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 09:53:28,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:28,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:28,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:28,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:53:28,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:28,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-31 09:53:28,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:28,796 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2018-12-31 09:53:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:29,076 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-12-31 09:53:29,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:29,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-31 09:53:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:29,079 INFO L225 Difference]: With dead ends: 57 [2018-12-31 09:53:29,079 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 09:53:29,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 09:53:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-12-31 09:53:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 09:53:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-12-31 09:53:29,094 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2018-12-31 09:53:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:29,094 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-31 09:53:29,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2018-12-31 09:53:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 09:53:29,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:29,097 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:29,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2018-12-31 09:53:29,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:29,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:29,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:29,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:29,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 09:53:29,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:29,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:29,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-31 09:53:29,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:29,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-31 09:53:29,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:29,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:29,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:29,402 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 10 states. [2018-12-31 09:53:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:30,037 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2018-12-31 09:53:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:30,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-12-31 09:53:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:30,040 INFO L225 Difference]: With dead ends: 67 [2018-12-31 09:53:30,040 INFO L226 Difference]: Without dead ends: 63 [2018-12-31 09:53:30,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-31 09:53:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2018-12-31 09:53:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:53:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2018-12-31 09:53:30,058 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 50 [2018-12-31 09:53:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:30,059 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2018-12-31 09:53:30,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2018-12-31 09:53:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 09:53:30,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:30,062 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:30,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1353550601, now seen corresponding path program 2 times [2018-12-31 09:53:30,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:30,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:30,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:30,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:30,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 09:53:30,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:30,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:30,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:53:30,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:53:30,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:30,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:30,668 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 09:53:30,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:30,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-31 09:53:30,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 09:53:30,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 09:53:30,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:53:30,689 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 16 states. [2018-12-31 09:53:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:31,796 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2018-12-31 09:53:31,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 09:53:31,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-12-31 09:53:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:31,802 INFO L225 Difference]: With dead ends: 142 [2018-12-31 09:53:31,802 INFO L226 Difference]: Without dead ends: 99 [2018-12-31 09:53:31,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-12-31 09:53:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-31 09:53:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2018-12-31 09:53:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-31 09:53:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 153 transitions. [2018-12-31 09:53:31,830 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 153 transitions. Word has length 76 [2018-12-31 09:53:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:31,831 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 153 transitions. [2018-12-31 09:53:31,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 09:53:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 153 transitions. [2018-12-31 09:53:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-31 09:53:31,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:31,840 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 09:53:31,840 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2005756209, now seen corresponding path program 1 times [2018-12-31 09:53:31,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:31,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:31,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:32,231 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 09:53:32,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:32,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:32,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:32,709 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 09:53:32,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:32,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-31 09:53:32,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 09:53:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 09:53:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-31 09:53:32,732 INFO L87 Difference]: Start difference. First operand 83 states and 153 transitions. Second operand 18 states. [2018-12-31 09:53:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:34,305 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2018-12-31 09:53:34,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 09:53:34,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 158 [2018-12-31 09:53:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:34,311 INFO L225 Difference]: With dead ends: 235 [2018-12-31 09:53:34,311 INFO L226 Difference]: Without dead ends: 154 [2018-12-31 09:53:34,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2018-12-31 09:53:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-31 09:53:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2018-12-31 09:53:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-31 09:53:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 239 transitions. [2018-12-31 09:53:34,347 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 239 transitions. Word has length 158 [2018-12-31 09:53:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:34,348 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 239 transitions. [2018-12-31 09:53:34,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 09:53:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 239 transitions. [2018-12-31 09:53:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-31 09:53:34,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:34,363 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 21, 20, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:34,363 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash -32820623, now seen corresponding path program 2 times [2018-12-31 09:53:34,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:34,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:34,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 202 proven. 308 refuted. 0 times theorem prover too weak. 2966 trivial. 0 not checked. [2018-12-31 09:53:34,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:34,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:34,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:53:34,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:53:34,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:34,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 207 proven. 447 refuted. 0 times theorem prover too weak. 2822 trivial. 0 not checked. [2018-12-31 09:53:35,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:35,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-12-31 09:53:35,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 09:53:35,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 09:53:35,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-31 09:53:35,193 INFO L87 Difference]: Start difference. First operand 135 states and 239 transitions. Second operand 13 states. [2018-12-31 09:53:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:36,379 INFO L93 Difference]: Finished difference Result 269 states and 538 transitions. [2018-12-31 09:53:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 09:53:36,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 350 [2018-12-31 09:53:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:36,383 INFO L225 Difference]: With dead ends: 269 [2018-12-31 09:53:36,383 INFO L226 Difference]: Without dead ends: 102 [2018-12-31 09:53:36,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-12-31 09:53:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-31 09:53:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2018-12-31 09:53:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-31 09:53:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2018-12-31 09:53:36,403 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 350 [2018-12-31 09:53:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:36,404 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2018-12-31 09:53:36,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 09:53:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2018-12-31 09:53:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-31 09:53:36,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:36,407 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 09:53:36,407 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash -981199599, now seen corresponding path program 3 times [2018-12-31 09:53:36,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:36,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:36,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:36,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:36,676 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 09:53:36,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:36,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:36,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:53:36,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 09:53:36,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:36,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 303 proven. 33 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2018-12-31 09:53:37,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:37,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-12-31 09:53:37,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 09:53:37,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 09:53:37,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-12-31 09:53:37,021 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand 20 states. [2018-12-31 09:53:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:38,840 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2018-12-31 09:53:38,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 09:53:38,841 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 186 [2018-12-31 09:53:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:38,843 INFO L225 Difference]: With dead ends: 208 [2018-12-31 09:53:38,843 INFO L226 Difference]: Without dead ends: 119 [2018-12-31 09:53:38,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 09:53:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-31 09:53:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-12-31 09:53:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-31 09:53:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2018-12-31 09:53:38,860 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 186 [2018-12-31 09:53:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:38,860 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2018-12-31 09:53:38,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 09:53:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2018-12-31 09:53:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-31 09:53:38,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:38,863 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 11, 10, 10, 9, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:38,864 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash 821839543, now seen corresponding path program 4 times [2018-12-31 09:53:38,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:38,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:38,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:38,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 220 proven. 13 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2018-12-31 09:53:39,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:39,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:53:39,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:53:39,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:39,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 123 proven. 111 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-12-31 09:53:39,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:39,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-12-31 09:53:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 09:53:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 09:53:39,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-31 09:53:39,444 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand 17 states. [2018-12-31 09:53:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:39,999 INFO L93 Difference]: Finished difference Result 249 states and 383 transitions. [2018-12-31 09:53:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 09:53:40,001 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2018-12-31 09:53:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:40,004 INFO L225 Difference]: With dead ends: 249 [2018-12-31 09:53:40,004 INFO L226 Difference]: Without dead ends: 123 [2018-12-31 09:53:40,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-12-31 09:53:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-31 09:53:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-12-31 09:53:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 09:53:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2018-12-31 09:53:40,021 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 173 [2018-12-31 09:53:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:40,021 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-12-31 09:53:40,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 09:53:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2018-12-31 09:53:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-31 09:53:40,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:40,024 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 09:53:40,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:40,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:40,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1495941360, now seen corresponding path program 5 times [2018-12-31 09:53:40,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:40,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:40,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:40,262 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 09:53:40,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:40,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:53:40,273 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:53:40,329 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-31 09:53:40,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:40,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-12-31 09:53:40,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:40,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28] total 33 [2018-12-31 09:53:40,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-31 09:53:40,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-31 09:53:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 09:53:40,890 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 33 states. [2018-12-31 09:53:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:41,998 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2018-12-31 09:53:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-31 09:53:41,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 174 [2018-12-31 09:53:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:42,003 INFO L225 Difference]: With dead ends: 238 [2018-12-31 09:53:42,003 INFO L226 Difference]: Without dead ends: 122 [2018-12-31 09:53:42,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=344, Invalid=2736, Unknown=0, NotChecked=0, Total=3080 [2018-12-31 09:53:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-31 09:53:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2018-12-31 09:53:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-31 09:53:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2018-12-31 09:53:42,019 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 174 [2018-12-31 09:53:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:42,020 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2018-12-31 09:53:42,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-31 09:53:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2018-12-31 09:53:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-31 09:53:42,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:42,022 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 09:53:42,022 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:42,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 6 times [2018-12-31 09:53:42,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:42,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:42,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:42,086 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:53:42,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:53:42 BoogieIcfgContainer [2018-12-31 09:53:42,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:53:42,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:53:42,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:53:42,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:53:42,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:24" (3/4) ... [2018-12-31 09:53:42,146 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:53:42,242 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:53:42,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:53:42,243 INFO L168 Benchmark]: Toolchain (without parser) took 18213.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -244.1 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:42,245 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 09:53:42,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:42,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.22 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:42,246 INFO L168 Benchmark]: Boogie Preprocessor took 36.67 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:42,247 INFO L168 Benchmark]: RCFGBuilder took 516.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:42,247 INFO L168 Benchmark]: TraceAbstraction took 17190.64 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:42,248 INFO L168 Benchmark]: Witness Printer took 100.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:42,251 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 307.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.22 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.67 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 516.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17190.64 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * Witness Printer took 100.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. UNSAFE Result, 17.0s OverallTime, 14 OverallIterations, 26 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 357 SDtfs, 471 SDslu, 2364 SDs, 0 SdLazy, 3520 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1500 GetRequests, 1242 SyntacticMatches, 3 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 112 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2758 NumberOfCodeBlocks, 2638 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2561 ConstructedInterpolants, 0 QuantifiedInterpolants, 681131 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2594 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 12169/13750 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...