./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 ../sv-benchmarks/c/recursive-simple/fibo_7-2.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2c28e4a28eb31322d66c263b5716511ec5353f2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-20 01:47:51,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:47:51,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:47:51,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:47:51,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:47:51,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:47:51,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:47:51,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:47:51,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:47:51,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:47:51,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:47:51,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:47:51,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:47:51,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:47:51,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:47:51,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:47:51,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:47:51,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:47:51,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:47:51,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:47:51,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:47:51,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:47:51,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:47:51,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:47:51,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:47:51,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:47:51,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:47:51,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:47:51,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:47:51,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:47:51,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:47:51,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:47:51,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:47:51,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:47:51,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:47:51,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:47:51,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:47:51,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:47:51,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:47:51,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:47:51,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:47:51,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:47:51,191 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:47:51,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:47:51,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:47:51,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:47:51,195 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:47:51,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:47:51,196 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:47:51,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:47:51,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:47:51,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:47:51,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:47:51,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:47:51,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:47:51,199 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:47:51,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:47:51,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:47:51,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:47:51,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:47:51,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:47:51,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:47:51,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:47:51,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:47:51,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:47:51,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:47:51,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:47:51,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:47:51,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:47:51,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:47:51,203 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:47:51,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(reach_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 -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2020-10-20 01:47:51,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:47:51,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:47:51,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:47:51,450 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:47:51,453 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:47:51,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-10-20 01:47:51,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ea3daaf/719b76120ae44600b211897cfc632986/FLAG3b2cb48e7 [2020-10-20 01:47:52,019 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:47:52,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-10-20 01:47:52,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ea3daaf/719b76120ae44600b211897cfc632986/FLAG3b2cb48e7 [2020-10-20 01:47:52,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ea3daaf/719b76120ae44600b211897cfc632986 [2020-10-20 01:47:52,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:47:52,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:47:52,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:47:52,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:47:52,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:47:52,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d61419c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52, skipping insertion in model container [2020-10-20 01:47:52,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:47:52,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:47:52,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:47:52,754 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:47:52,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:47:52,788 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:47:52,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52 WrapperNode [2020-10-20 01:47:52,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:47:52,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:47:52,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:47:52,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:47:52,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:47:52,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:47:52,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:47:52,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:47:52,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (1/1) ... [2020-10-20 01:47:52,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:47:52,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:47:52,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:47:52,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:47:52,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (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 [2020-10-20 01:47:52,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:47:52,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:47:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:47:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:47:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-20 01:47:52,905 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-20 01:47:53,119 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:47:53,120 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 01:47:53,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:53 BoogieIcfgContainer [2020-10-20 01:47:53,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:47:53,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:47:53,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:47:53,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:47:53,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:47:52" (1/3) ... [2020-10-20 01:47:53,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601dce2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:47:53, skipping insertion in model container [2020-10-20 01:47:53,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:52" (2/3) ... [2020-10-20 01:47:53,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601dce2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:47:53, skipping insertion in model container [2020-10-20 01:47:53,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:53" (3/3) ... [2020-10-20 01:47:53,132 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-10-20 01:47:53,145 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:47:53,162 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:47:53,186 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:47:53,220 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:47:53,220 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:47:53,220 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:47:53,220 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:47:53,221 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:47:53,221 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:47:53,221 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:47:53,221 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:47:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-10-20 01:47:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 01:47:53,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:53,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:53,260 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash -730685886, now seen corresponding path program 1 times [2020-10-20 01:47:53,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:53,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076482141] [2020-10-20 01:47:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:47:53,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076482141] [2020-10-20 01:47:53,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:47:53,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:47:53,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194756663] [2020-10-20 01:47:53,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:47:53,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:47:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:53,532 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-10-20 01:47:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:53,593 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-10-20 01:47:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:47:53,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-20 01:47:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:53,605 INFO L225 Difference]: With dead ends: 35 [2020-10-20 01:47:53,606 INFO L226 Difference]: Without dead ends: 18 [2020-10-20 01:47:53,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-20 01:47:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 01:47:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 01:47:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-20 01:47:53,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-10-20 01:47:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:53,656 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-20 01:47:53,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:47:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-20 01:47:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:47:53,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:53,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:53,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:47:53,659 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash -461623668, now seen corresponding path program 1 times [2020-10-20 01:47:53,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:53,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965593825] [2020-10-20 01:47:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:47:53,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965593825] [2020-10-20 01:47:53,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:47:53,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:47:53,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111326338] [2020-10-20 01:47:53,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:47:53,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:53,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:47:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:53,754 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-10-20 01:47:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:53,774 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-20 01:47:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:47:53,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:47:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:53,776 INFO L225 Difference]: With dead ends: 24 [2020-10-20 01:47:53,776 INFO L226 Difference]: Without dead ends: 20 [2020-10-20 01:47:53,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-20 01:47:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-10-20 01:47:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 01:47:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-20 01:47:53,785 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-10-20 01:47:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:53,785 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-20 01:47:53,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:47:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-20 01:47:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 01:47:53,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:53,787 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:53,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:47:53,787 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1253239047, now seen corresponding path program 1 times [2020-10-20 01:47:53,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:53,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119471344] [2020-10-20 01:47:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 01:47:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:47:53,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119471344] [2020-10-20 01:47:53,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313873552] [2020-10-20 01:47:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:53,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:53,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:47:54,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:54,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-20 01:47:54,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633331571] [2020-10-20 01:47:54,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 01:47:54,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 01:47:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:47:54,094 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-10-20 01:47:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:54,237 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-10-20 01:47:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:47:54,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-20 01:47:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:54,239 INFO L225 Difference]: With dead ends: 35 [2020-10-20 01:47:54,239 INFO L226 Difference]: Without dead ends: 20 [2020-10-20 01:47:54,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:47:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-20 01:47:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 01:47:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 01:47:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-10-20 01:47:54,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-10-20 01:47:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:54,248 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-20 01:47:54,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 01:47:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-10-20 01:47:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 01:47:54,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:54,251 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:54,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-20 01:47:54,466 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1685451365, now seen corresponding path program 1 times [2020-10-20 01:47:54,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:54,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974210992] [2020-10-20 01:47:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:47:54,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974210992] [2020-10-20 01:47:54,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295324669] [2020-10-20 01:47:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:54,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:47:54,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:54,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 01:47:54,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441567669] [2020-10-20 01:47:54,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:47:54,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:54,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:47:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:47:54,698 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-10-20 01:47:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:54,797 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-10-20 01:47:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:47:54,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-20 01:47:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:54,800 INFO L225 Difference]: With dead ends: 38 [2020-10-20 01:47:54,800 INFO L226 Difference]: Without dead ends: 34 [2020-10-20 01:47:54,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:47:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-20 01:47:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-20 01:47:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 01:47:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-10-20 01:47:54,820 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-10-20 01:47:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:54,821 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-10-20 01:47:54,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:47:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-10-20 01:47:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:47:54,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:54,824 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:55,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:55,038 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash 228714308, now seen corresponding path program 2 times [2020-10-20 01:47:55,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:55,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392721374] [2020-10-20 01:47:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-20 01:47:55,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392721374] [2020-10-20 01:47:55,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104177820] [2020-10-20 01:47:55,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:55,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 01:47:55,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:55,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:47:55,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 01:47:55,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:55,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-20 01:47:55,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538327197] [2020-10-20 01:47:55,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 01:47:55,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 01:47:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:47:55,331 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-10-20 01:47:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:55,569 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-10-20 01:47:55,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 01:47:55,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-10-20 01:47:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:55,571 INFO L225 Difference]: With dead ends: 69 [2020-10-20 01:47:55,571 INFO L226 Difference]: Without dead ends: 38 [2020-10-20 01:47:55,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:47:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-20 01:47:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-20 01:47:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 01:47:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-10-20 01:47:55,581 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-10-20 01:47:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:55,582 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-10-20 01:47:55,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 01:47:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-10-20 01:47:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-20 01:47:55,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:55,594 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:55,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:55,797 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1825869943, now seen corresponding path program 3 times [2020-10-20 01:47:55,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:55,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117448955] [2020-10-20 01:47:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-10-20 01:47:56,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117448955] [2020-10-20 01:47:56,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269213013] [2020-10-20 01:47:56,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:56,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-20 01:47:56,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:56,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:47:56,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-10-20 01:47:56,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:56,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-10-20 01:47:56,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670899359] [2020-10-20 01:47:56,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 01:47:56,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 01:47:56,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:47:56,310 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-10-20 01:47:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:56,522 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-10-20 01:47:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 01:47:56,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-20 01:47:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:56,528 INFO L225 Difference]: With dead ends: 94 [2020-10-20 01:47:56,529 INFO L226 Difference]: Without dead ends: 90 [2020-10-20 01:47:56,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:47:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-20 01:47:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-10-20 01:47:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 01:47:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-10-20 01:47:56,551 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-10-20 01:47:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:56,552 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-10-20 01:47:56,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 01:47:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-10-20 01:47:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-20 01:47:56,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:56,559 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:56,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:56,773 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash -793137460, now seen corresponding path program 4 times [2020-10-20 01:47:56,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:56,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122791667] [2020-10-20 01:47:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-10-20 01:47:57,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122791667] [2020-10-20 01:47:57,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090698765] [2020-10-20 01:47:57,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:57,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 01:47:57,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:57,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 01:47:57,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-10-20 01:47:57,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:57,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-10-20 01:47:57,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526224592] [2020-10-20 01:47:57,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-20 01:47:57,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 01:47:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-20 01:47:57,760 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 17 states. [2020-10-20 01:47:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:58,498 INFO L93 Difference]: Finished difference Result 169 states and 322 transitions. [2020-10-20 01:47:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-20 01:47:58,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 201 [2020-10-20 01:47:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:58,502 INFO L225 Difference]: With dead ends: 169 [2020-10-20 01:47:58,502 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 01:47:58,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 01:47:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 01:47:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2020-10-20 01:47:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 01:47:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-10-20 01:47:58,519 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 201 [2020-10-20 01:47:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:58,520 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-10-20 01:47:58,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-20 01:47:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-10-20 01:47:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-10-20 01:47:58,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:58,527 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:58,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-20 01:47:58,742 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash 207835975, now seen corresponding path program 5 times [2020-10-20 01:47:58,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:58,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717137139] [2020-10-20 01:47:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-20 01:47:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-10-20 01:47:59,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717137139] [2020-10-20 01:47:59,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754781261] [2020-10-20 01:47:59,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:48:00,099 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2020-10-20 01:48:00,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:48:00,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 01:48:00,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:48:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1321 proven. 1303 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2020-10-20 01:48:00,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:48:00,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2020-10-20 01:48:00,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282993820] [2020-10-20 01:48:00,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-20 01:48:00,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:48:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 01:48:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-20 01:48:00,307 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 21 states. [2020-10-20 01:48:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:48:01,117 INFO L93 Difference]: Finished difference Result 192 states and 332 transitions. [2020-10-20 01:48:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-20 01:48:01,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 351 [2020-10-20 01:48:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:48:01,121 INFO L225 Difference]: With dead ends: 192 [2020-10-20 01:48:01,122 INFO L226 Difference]: Without dead ends: 119 [2020-10-20 01:48:01,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=411, Invalid=1569, Unknown=0, NotChecked=0, Total=1980 [2020-10-20 01:48:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-20 01:48:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2020-10-20 01:48:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 01:48:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2020-10-20 01:48:01,140 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 351 [2020-10-20 01:48:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:48:01,141 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2020-10-20 01:48:01,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-20 01:48:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2020-10-20 01:48:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-10-20 01:48:01,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:48:01,146 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:48:01,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:48:01,360 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:48:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:48:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash 196240028, now seen corresponding path program 6 times [2020-10-20 01:48:01,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:48:01,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175000929] [2020-10-20 01:48:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:48:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:48:01,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:48:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:48:01,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:48:01,625 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:48:01,626 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:48:01,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:48:01,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:48:01 BoogieIcfgContainer [2020-10-20 01:48:01,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:48:01,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:48:01,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:48:01,781 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:48:01,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:53" (3/4) ... [2020-10-20 01:48:01,785 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:48:01,906 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:48:01,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:48:01,909 INFO L168 Benchmark]: Toolchain (without parser) took 9498.17 ms. Allocated memory was 35.7 MB in the beginning and 141.6 MB in the end (delta: 105.9 MB). Free memory was 13.8 MB in the beginning and 107.3 MB in the end (delta: -93.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,909 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 34.1 MB. Free memory was 19.6 MB in the beginning and 19.5 MB in the end (delta: 30.8 kB). Peak memory consumption was 30.8 kB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.21 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 12.9 MB in the beginning and 24.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.47 ms. Allocated memory is still 44.0 MB. Free memory was 24.4 MB in the beginning and 22.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,911 INFO L168 Benchmark]: Boogie Preprocessor took 18.63 ms. Allocated memory is still 44.0 MB. Free memory was 22.9 MB in the beginning and 21.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,911 INFO L168 Benchmark]: RCFGBuilder took 279.34 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 21.5 MB in the beginning and 21.0 MB in the end (delta: 574.6 kB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,912 INFO L168 Benchmark]: TraceAbstraction took 8656.25 ms. Allocated memory was 45.6 MB in the beginning and 140.5 MB in the end (delta: 94.9 MB). Free memory was 20.5 MB in the beginning and 10.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 104.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,912 INFO L168 Benchmark]: Witness Printer took 125.87 ms. Allocated memory was 140.5 MB in the beginning and 141.6 MB in the end (delta: 1.0 MB). Free memory was 10.7 MB in the beginning and 107.3 MB in the end (delta: -96.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:01,918 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87 ms. Allocated memory is still 34.1 MB. Free memory was 19.6 MB in the beginning and 19.5 MB in the end (delta: 30.8 kB). Peak memory consumption was 30.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 372.21 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 12.9 MB in the beginning and 24.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 34.47 ms. Allocated memory is still 44.0 MB. Free memory was 24.4 MB in the beginning and 22.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 18.63 ms. Allocated memory is still 44.0 MB. Free memory was 22.9 MB in the beginning and 21.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 279.34 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 21.5 MB in the beginning and 21.0 MB in the end (delta: 574.6 kB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 8656.25 ms. Allocated memory was 45.6 MB in the beginning and 140.5 MB in the end (delta: 94.9 MB). Free memory was 20.5 MB in the beginning and 10.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 104.7 MB. Max. memory is 14.3 GB. * Witness Printer took 125.87 ms. Allocated memory was 140.5 MB in the beginning and 141.6 MB in the end (delta: 1.0 MB). Free memory was 10.7 MB in the beginning and 107.3 MB in the end (delta: -96.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) 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 fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(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 fibo(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 fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(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] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(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 fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(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] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) 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 fibo(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 fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(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] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(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 fibo(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 fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(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] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(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 fibo(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 fibo(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] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(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] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 9, TraceHistogramMax: 51, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 458 SDslu, 528 SDs, 0 SdLazy, 1090 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1734 NumberOfCodeBlocks, 1642 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1437 ConstructedInterpolants, 0 QuantifiedInterpolants, 520807 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 14921/19458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...