./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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.5.800.v20200727-1323.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_10-1.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 faad93e560ba524ae1ece04545479d8bfc495d5f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.1-dev-20ed64e [2021-08-26 08:46:11,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 08:46:11,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 08:46:11,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 08:46:11,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 08:46:11,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 08:46:11,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 08:46:11,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 08:46:11,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 08:46:11,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 08:46:11,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 08:46:11,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 08:46:11,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 08:46:11,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 08:46:11,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 08:46:11,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 08:46:11,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 08:46:11,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 08:46:11,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 08:46:11,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 08:46:11,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 08:46:11,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 08:46:11,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 08:46:11,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 08:46:11,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 08:46:11,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 08:46:11,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 08:46:11,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 08:46:11,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 08:46:11,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 08:46:11,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 08:46:11,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 08:46:11,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 08:46:11,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 08:46:11,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 08:46:11,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 08:46:11,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 08:46:11,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 08:46:11,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 08:46:11,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 08:46:11,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 08:46:11,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 08:46:11,284 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 08:46:11,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 08:46:11,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 08:46:11,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 08:46:11,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 08:46:11,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 08:46:11,287 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 08:46:11,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 08:46:11,288 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 08:46:11,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 08:46:11,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 08:46:11,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 08:46:11,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 08:46:11,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 08:46:11,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 08:46:11,290 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 08:46:11,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 08:46:11,290 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 08:46:11,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 08:46:11,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 08:46:11,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 08:46:11,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 08:46:11,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:46:11,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 08:46:11,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 08:46:11,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 08:46:11,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 08:46:11,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 08:46:11,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 08:46:11,298 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 08:46:11,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> faad93e560ba524ae1ece04545479d8bfc495d5f [2021-08-26 08:46:11,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 08:46:11,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 08:46:11,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 08:46:11,595 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 08:46:11,595 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 08:46:11,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-08-26 08:46:11,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab26a8ac/4e6aa57168434e458a09a85bb15dc8ea/FLAG6cc93de39 [2021-08-26 08:46:12,112 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 08:46:12,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-08-26 08:46:12,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab26a8ac/4e6aa57168434e458a09a85bb15dc8ea/FLAG6cc93de39 [2021-08-26 08:46:12,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab26a8ac/4e6aa57168434e458a09a85bb15dc8ea [2021-08-26 08:46:12,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 08:46:12,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 08:46:12,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 08:46:12,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 08:46:12,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 08:46:12,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bf4eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12, skipping insertion in model container [2021-08-26 08:46:12,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 08:46:12,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 08:46:12,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-08-26 08:46:12,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:46:12,700 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 08:46:12,716 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-08-26 08:46:12,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:46:12,729 INFO L208 MainTranslator]: Completed translation [2021-08-26 08:46:12,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12 WrapperNode [2021-08-26 08:46:12,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 08:46:12,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 08:46:12,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 08:46:12,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 08:46:12,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 08:46:12,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 08:46:12,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 08:46:12,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 08:46:12,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 08:46:12,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 08:46:12,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 08:46:12,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 08:46:12,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (1/1) ... [2021-08-26 08:46:12,829 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:46:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:12,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 08:46:12,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 08:46:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 08:46:12,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 08:46:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 08:46:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 08:46:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-08-26 08:46:12,900 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-08-26 08:46:13,153 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 08:46:13,168 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 08:46:13,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:46:13 BoogieIcfgContainer [2021-08-26 08:46:13,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 08:46:13,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 08:46:13,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 08:46:13,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 08:46:13,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:46:12" (1/3) ... [2021-08-26 08:46:13,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0b2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:46:13, skipping insertion in model container [2021-08-26 08:46:13,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:46:12" (2/3) ... [2021-08-26 08:46:13,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0b2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:46:13, skipping insertion in model container [2021-08-26 08:46:13,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:46:13" (3/3) ... [2021-08-26 08:46:13,178 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-08-26 08:46:13,183 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 08:46:13,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 08:46:13,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 08:46:13,264 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 08:46:13,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 08:46:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-26 08:46:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 08:46:13,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:13,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:13,291 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-08-26 08:46:13,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:13,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277929109] [2021-08-26 08:46:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:13,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:46:13,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:13,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277929109] [2021-08-26 08:46:13,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277929109] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:46:13,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:46:13,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:46:13,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513855708] [2021-08-26 08:46:13,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:46:13,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:46:13,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:46:13,633 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:46:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:13,684 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-08-26 08:46:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:46:13,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-26 08:46:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:13,691 INFO L225 Difference]: With dead ends: 34 [2021-08-26 08:46:13,691 INFO L226 Difference]: Without dead ends: 18 [2021-08-26 08:46:13,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:46:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-26 08:46:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-26 08:46:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 08:46:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 08:46:13,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-26 08:46:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:13,731 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 08:46:13,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:46:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 08:46:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 08:46:13,734 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:13,734 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:13,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 08:46:13,735 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-08-26 08:46:13,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:13,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034794674] [2021-08-26 08:46:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:13,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:46:13,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:13,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034794674] [2021-08-26 08:46:13,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034794674] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:46:13,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:46:13,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:46:13,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057270169] [2021-08-26 08:46:13,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:46:13,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:13,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:46:13,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:46:13,833 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:46:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:13,853 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-26 08:46:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:46:13,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-26 08:46:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:13,855 INFO L225 Difference]: With dead ends: 24 [2021-08-26 08:46:13,855 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 08:46:13,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:46:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 08:46:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-26 08:46:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 08:46:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 08:46:13,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-26 08:46:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:13,868 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 08:46:13,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:46:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 08:46:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 08:46:13,869 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:13,869 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:13,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 08:46:13,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-08-26 08:46:13,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:13,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725869693] [2021-08-26 08:46:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:13,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-26 08:46:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:46:13,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:13,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725869693] [2021-08-26 08:46:13,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725869693] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:13,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006197205] [2021-08-26 08:46:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:13,956 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:13,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 08:46:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:14,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 08:46:14,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:46:14,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006197205] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:14,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:14,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-26 08:46:14,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256064518] [2021-08-26 08:46:14,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 08:46:14,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:14,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 08:46:14,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:46:14,208 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-26 08:46:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:14,308 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-08-26 08:46:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 08:46:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2021-08-26 08:46:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:14,312 INFO L225 Difference]: With dead ends: 35 [2021-08-26 08:46:14,312 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 08:46:14,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:46:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 08:46:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-26 08:46:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-26 08:46:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-08-26 08:46:14,318 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-08-26 08:46:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:14,318 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-26 08:46:14,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-26 08:46:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-08-26 08:46:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 08:46:14,320 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:14,320 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:14,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-26 08:46:14,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:14,537 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-08-26 08:46:14,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:14,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765251741] [2021-08-26 08:46:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:14,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:14,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:14,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 08:46:14,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:14,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765251741] [2021-08-26 08:46:14,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765251741] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:14,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617783696] [2021-08-26 08:46:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:14,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:14,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:14,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:14,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 08:46:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:14,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 08:46:14,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 08:46:14,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617783696] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:14,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:14,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-08-26 08:46:14,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323325445] [2021-08-26 08:46:14,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 08:46:14,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 08:46:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-26 08:46:14,833 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 08:46:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:14,931 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-08-26 08:46:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:46:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-08-26 08:46:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:14,937 INFO L225 Difference]: With dead ends: 38 [2021-08-26 08:46:14,937 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 08:46:14,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:46:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 08:46:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-26 08:46:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-08-26 08:46:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-08-26 08:46:14,955 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-08-26 08:46:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:14,956 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-08-26 08:46:14,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 08:46:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-08-26 08:46:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 08:46:14,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:14,959 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:14,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:15,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-26 08:46:15,173 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-08-26 08:46:15,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:15,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722946122] [2021-08-26 08:46:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:15,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:15,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:15,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-26 08:46:15,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:15,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722946122] [2021-08-26 08:46:15,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722946122] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:15,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819622751] [2021-08-26 08:46:15,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 08:46:15,319 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:15,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:15,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:15,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 08:46:15,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 08:46:15,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:15,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 08:46:15,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 08:46:15,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819622751] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:15,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:15,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-26 08:46:15,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241275577] [2021-08-26 08:46:15,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 08:46:15,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 08:46:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:46:15,668 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-26 08:46:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:15,887 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-08-26 08:46:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 08:46:15,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 37 [2021-08-26 08:46:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:15,889 INFO L225 Difference]: With dead ends: 69 [2021-08-26 08:46:15,889 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 08:46:15,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 156.3ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-08-26 08:46:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 08:46:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-26 08:46:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-26 08:46:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-08-26 08:46:15,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-08-26 08:46:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:15,897 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-08-26 08:46:15,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-26 08:46:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-08-26 08:46:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-26 08:46:15,899 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:15,899 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:15,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:16,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:16,117 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-08-26 08:46:16,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:16,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455882901] [2021-08-26 08:46:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:16,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-08-26 08:46:16,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:16,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455882901] [2021-08-26 08:46:16,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455882901] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:16,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063409953] [2021-08-26 08:46:16,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 08:46:16,382 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:16,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:16,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 08:46:16,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-26 08:46:16,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:16,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 08:46:16,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-08-26 08:46:16,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063409953] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:16,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:16,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-08-26 08:46:16,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609925451] [2021-08-26 08:46:16,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 08:46:16,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 08:46:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:46:16,744 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-26 08:46:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:16,897 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-08-26 08:46:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 08:46:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 65 [2021-08-26 08:46:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:16,903 INFO L225 Difference]: With dead ends: 85 [2021-08-26 08:46:16,903 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 08:46:16,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 105.0ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-26 08:46:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 08:46:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-08-26 08:46:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-26 08:46:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-08-26 08:46:16,925 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-08-26 08:46:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:16,927 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-08-26 08:46:16,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-26 08:46:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-08-26 08:46:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-26 08:46:16,933 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:16,933 INFO L512 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:16,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:17,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:17,134 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-08-26 08:46:17,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:17,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435131505] [2021-08-26 08:46:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:17,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-26 08:46:17,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:17,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435131505] [2021-08-26 08:46:17,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435131505] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:17,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301483762] [2021-08-26 08:46:17,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 08:46:17,524 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:17,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:17,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 08:46:17,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 08:46:17,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:17,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 08:46:17,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-26 08:46:18,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301483762] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:18,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:18,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2021-08-26 08:46:18,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205380793] [2021-08-26 08:46:18,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 08:46:18,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 08:46:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-26 08:46:18,188 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2021-08-26 08:46:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:18,342 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-08-26 08:46:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 08:46:18,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) Word has length 147 [2021-08-26 08:46:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:18,356 INFO L225 Difference]: With dead ends: 117 [2021-08-26 08:46:18,356 INFO L226 Difference]: Without dead ends: 113 [2021-08-26 08:46:18,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-26 08:46:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-26 08:46:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-08-26 08:46:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2021-08-26 08:46:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-08-26 08:46:18,385 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-08-26 08:46:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:18,386 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-08-26 08:46:18,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2021-08-26 08:46:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-08-26 08:46:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-08-26 08:46:18,394 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:18,395 INFO L512 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:18,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-08-26 08:46:18,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:18,619 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-08-26 08:46:18,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:18,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369787785] [2021-08-26 08:46:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:18,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-08-26 08:46:19,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:19,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369787785] [2021-08-26 08:46:19,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369787785] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:19,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662126607] [2021-08-26 08:46:19,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 08:46:19,173 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:19,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:19,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:19,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 08:46:19,417 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-08-26 08:46:19,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:19,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 08:46:19,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-08-26 08:46:20,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662126607] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:20,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:20,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2021-08-26 08:46:20,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766238320] [2021-08-26 08:46:20,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-26 08:46:20,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:20,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-26 08:46:20,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-08-26 08:46:20,183 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2021-08-26 08:46:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:20,763 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-08-26 08:46:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-26 08:46:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) Word has length 215 [2021-08-26 08:46:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:20,766 INFO L225 Difference]: With dead ends: 193 [2021-08-26 08:46:20,766 INFO L226 Difference]: Without dead ends: 95 [2021-08-26 08:46:20,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 398.4ms TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2021-08-26 08:46:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-26 08:46:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-08-26 08:46:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2021-08-26 08:46:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-08-26 08:46:20,777 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-08-26 08:46:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:20,777 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-26 08:46:20,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2021-08-26 08:46:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-08-26 08:46:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-08-26 08:46:20,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:20,781 INFO L512 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:20,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:20,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:20,997 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2021-08-26 08:46:20,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:20,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968940408] [2021-08-26 08:46:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:20,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-08-26 08:46:21,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:21,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968940408] [2021-08-26 08:46:21,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968940408] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:21,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764354811] [2021-08-26 08:46:21,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 08:46:21,800 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:21,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:21,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:21,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 08:46:22,122 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-08-26 08:46:22,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:22,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 08:46:22,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2021-08-26 08:46:23,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764354811] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:23,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:23,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 26 [2021-08-26 08:46:23,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220993925] [2021-08-26 08:46:23,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-26 08:46:23,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-26 08:46:23,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-08-26 08:46:23,070 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (34), 23 states have call predecessors, (34), 17 states have call successors, (34) [2021-08-26 08:46:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:23,648 INFO L93 Difference]: Finished difference Result 186 states and 295 transitions. [2021-08-26 08:46:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-26 08:46:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (34), 23 states have call predecessors, (34), 17 states have call successors, (34) Word has length 351 [2021-08-26 08:46:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:23,651 INFO L225 Difference]: With dead ends: 186 [2021-08-26 08:46:23,651 INFO L226 Difference]: Without dead ends: 113 [2021-08-26 08:46:23,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 456.2ms TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2021-08-26 08:46:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-26 08:46:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2021-08-26 08:46:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 70 states have internal predecessors, (75), 19 states have call successors, (19), 15 states have call predecessors, (19), 9 states have return successors, (42), 15 states have call predecessors, (42), 19 states have call successors, (42) [2021-08-26 08:46:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2021-08-26 08:46:23,663 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 351 [2021-08-26 08:46:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:23,663 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2021-08-26 08:46:23,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (34), 23 states have call predecessors, (34), 17 states have call successors, (34) [2021-08-26 08:46:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2021-08-26 08:46:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2021-08-26 08:46:23,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:23,674 INFO L512 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:23,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:23,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:23,893 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:23,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2021-08-26 08:46:23,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:23,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600198151] [2021-08-26 08:46:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:23,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 08:46:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2021-08-26 08:46:25,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:25,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600198151] [2021-08-26 08:46:25,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600198151] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:25,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737527033] [2021-08-26 08:46:25,329 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 08:46:25,330 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:25,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:25,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:25,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 08:46:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:25,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-26 08:46:25,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2021-08-26 08:46:27,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737527033] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:27,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:27,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 30 [2021-08-26 08:46:27,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976144727] [2021-08-26 08:46:27,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-26 08:46:27,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-26 08:46:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2021-08-26 08:46:27,457 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 22 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) [2021-08-26 08:46:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:28,203 INFO L93 Difference]: Finished difference Result 228 states and 374 transitions. [2021-08-26 08:46:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-26 08:46:28,204 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 22 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) Word has length 569 [2021-08-26 08:46:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:28,206 INFO L225 Difference]: With dead ends: 228 [2021-08-26 08:46:28,206 INFO L226 Difference]: Without dead ends: 138 [2021-08-26 08:46:28,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 466.4ms TimeCoverageRelationStatistics Valid=558, Invalid=2094, Unknown=0, NotChecked=0, Total=2652 [2021-08-26 08:46:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-26 08:46:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2021-08-26 08:46:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 82 states have internal predecessors, (87), 23 states have call successors, (23), 18 states have call predecessors, (23), 10 states have return successors, (54), 17 states have call predecessors, (54), 23 states have call successors, (54) [2021-08-26 08:46:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2021-08-26 08:46:28,218 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 569 [2021-08-26 08:46:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:28,219 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2021-08-26 08:46:28,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 22 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) [2021-08-26 08:46:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2021-08-26 08:46:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2021-08-26 08:46:28,225 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:28,225 INFO L512 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:28,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:28,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 08:46:28,441 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2021-08-26 08:46:28,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:28,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544741377] [2021-08-26 08:46:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:28,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 08:46:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-08-26 08:46:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 08:46:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3273 proven. 6787 refuted. 0 times theorem prover too weak. 40850 trivial. 0 not checked. [2021-08-26 08:46:30,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:30,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544741377] [2021-08-26 08:46:30,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544741377] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:30,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694839871] [2021-08-26 08:46:30,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 08:46:30,698 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:30,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:30,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 08:46:31,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 08:46:31,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:31,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 08:46:31,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2021-08-26 08:46:33,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694839871] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:33,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:33,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13] total 34 [2021-08-26 08:46:33,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111653577] [2021-08-26 08:46:33,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-26 08:46:33,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-26 08:46:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2021-08-26 08:46:33,811 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 25 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (48), 30 states have call predecessors, (48), 25 states have call successors, (48) [2021-08-26 08:46:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:34,616 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2021-08-26 08:46:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-26 08:46:34,625 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 25 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (48), 30 states have call predecessors, (48), 25 states have call successors, (48) Word has length 923 [2021-08-26 08:46:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:34,631 INFO L225 Difference]: With dead ends: 266 [2021-08-26 08:46:34,631 INFO L226 Difference]: Without dead ends: 159 [2021-08-26 08:46:34,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1192 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 584.7ms TimeCoverageRelationStatistics Valid=712, Invalid=2828, Unknown=0, NotChecked=0, Total=3540 [2021-08-26 08:46:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-26 08:46:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2021-08-26 08:46:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.03125) internal successors, (99), 94 states have internal predecessors, (99), 27 states have call successors, (27), 21 states have call predecessors, (27), 11 states have return successors, (67), 19 states have call predecessors, (67), 27 states have call successors, (67) [2021-08-26 08:46:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2021-08-26 08:46:34,666 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 923 [2021-08-26 08:46:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:34,669 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2021-08-26 08:46:34,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 25 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (48), 30 states have call predecessors, (48), 25 states have call successors, (48) [2021-08-26 08:46:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2021-08-26 08:46:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2021-08-26 08:46:34,692 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:34,693 INFO L512 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:34,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:34,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:34,893 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 9 times [2021-08-26 08:46:34,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:34,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792500357] [2021-08-26 08:46:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:34,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:46:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 08:46:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-08-26 08:46:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-08-26 08:46:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 08:46:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-08-26 08:46:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 08:46:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 08:46:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:46:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:46:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:46:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:46:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:46:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:46:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6145 proven. 13082 refuted. 0 times theorem prover too weak. 115377 trivial. 0 not checked. [2021-08-26 08:46:38,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:46:38,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792500357] [2021-08-26 08:46:38,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792500357] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:38,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254581931] [2021-08-26 08:46:38,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 08:46:38,712 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:38,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:46:38,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:46:38,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 08:46:40,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2021-08-26 08:46:40,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:46:40,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 08:46:40,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:46:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5994 proven. 991 refuted. 0 times theorem prover too weak. 127619 trivial. 0 not checked. [2021-08-26 08:46:43,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254581931] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:46:43,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:46:43,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10] total 40 [2021-08-26 08:46:43,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466370596] [2021-08-26 08:46:43,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-08-26 08:46:43,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:46:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-26 08:46:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2021-08-26 08:46:43,522 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 19 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 36 states have call predecessors, (42), 19 states have call successors, (42) [2021-08-26 08:46:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:46:44,810 INFO L93 Difference]: Finished difference Result 343 states and 686 transitions. [2021-08-26 08:46:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-08-26 08:46:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 19 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 36 states have call predecessors, (42), 19 states have call successors, (42) Word has length 1495 [2021-08-26 08:46:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:46:44,815 INFO L225 Difference]: With dead ends: 343 [2021-08-26 08:46:44,815 INFO L226 Difference]: Without dead ends: 191 [2021-08-26 08:46:44,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1930 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 824.0ms TimeCoverageRelationStatistics Valid=1021, Invalid=4529, Unknown=0, NotChecked=0, Total=5550 [2021-08-26 08:46:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-08-26 08:46:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-08-26 08:46:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 115 states have (on average 1.017391304347826) internal successors, (117), 113 states have internal predecessors, (117), 34 states have call successors, (34), 27 states have call predecessors, (34), 11 states have return successors, (71), 20 states have call predecessors, (71), 34 states have call successors, (71) [2021-08-26 08:46:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2021-08-26 08:46:44,834 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1495 [2021-08-26 08:46:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:46:44,836 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2021-08-26 08:46:44,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 19 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 36 states have call predecessors, (42), 19 states have call successors, (42) [2021-08-26 08:46:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2021-08-26 08:46:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-08-26 08:46:44,846 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:46:44,847 INFO L512 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:46:44,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:45,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-26 08:46:45,061 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:45,061 INFO L82 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-08-26 08:46:45,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:45,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247888326] [2021-08-26 08:46:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:45,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 08:46:45,251 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 08:46:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 08:46:45,783 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 08:46:45,784 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 08:46:45,784 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:46:45,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 08:46:45,795 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 08:46:46,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:46:46 BoogieIcfgContainer [2021-08-26 08:46:46,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 08:46:46,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 08:46:46,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 08:46:46,005 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 08:46:46,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:46:13" (3/4) ... [2021-08-26 08:46:46,008 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 08:46:46,203 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 08:46:46,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 08:46:46,205 INFO L168 Benchmark]: Toolchain (without parser) took 33670.46 ms. Allocated memory was 48.2 MB in the beginning and 641.7 MB in the end (delta: 593.5 MB). Free memory was 24.3 MB in the beginning and 417.2 MB in the end (delta: -393.0 MB). Peak memory consumption was 201.5 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:46,206 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 48.2 MB. Free memory was 30.5 MB in the beginning and 30.5 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:46,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.90 ms. Allocated memory is still 48.2 MB. Free memory was 24.1 MB in the beginning and 26.1 MB in the end (delta: -2.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:46,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.06 ms. Allocated memory is still 48.2 MB. Free memory was 26.1 MB in the beginning and 24.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:46,207 INFO L168 Benchmark]: Boogie Preprocessor took 55.46 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 24.8 MB in the beginning and 42.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:46,207 INFO L168 Benchmark]: RCFGBuilder took 349.90 ms. Allocated memory is still 58.7 MB. Free memory was 42.6 MB in the beginning and 30.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:46,207 INFO L168 Benchmark]: TraceAbstraction took 32831.47 ms. Allocated memory was 58.7 MB in the beginning and 641.7 MB in the end (delta: 583.0 MB). Free memory was 30.3 MB in the beginning and 464.4 MB in the end (delta: -434.1 MB). Peak memory consumption was 438.8 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:46,207 INFO L168 Benchmark]: Witness Printer took 199.11 ms. Allocated memory is still 641.7 MB. Free memory was 464.4 MB in the beginning and 417.2 MB in the end (delta: 47.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:46,209 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.20 ms. Allocated memory is still 48.2 MB. Free memory was 30.5 MB in the beginning and 30.5 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 197.90 ms. Allocated memory is still 48.2 MB. Free memory was 24.1 MB in the beginning and 26.1 MB in the end (delta: -2.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.06 ms. Allocated memory is still 48.2 MB. Free memory was 26.1 MB in the beginning and 24.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.46 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 24.8 MB in the beginning and 42.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 349.90 ms. Allocated memory is still 58.7 MB. Free memory was 42.6 MB in the beginning and 30.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32831.47 ms. Allocated memory was 58.7 MB in the beginning and 641.7 MB in the end (delta: 583.0 MB). Free memory was 30.3 MB in the beginning and 464.4 MB in the end (delta: -434.1 MB). Peak memory consumption was 438.8 MB. Max. memory is 16.1 GB. * Witness Printer took 199.11 ms. Allocated memory is still 641.7 MB. Free memory was 464.4 MB in the beginning and 417.2 MB in the end (delta: 47.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) 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); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) 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-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) 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); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) 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); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) 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-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32535.4ms, OverallIterations: 13, TraceHistogramMax: 219, EmptinessCheckTime: 82.8ms, AutomataDifference: 4908.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 292 SDtfs, 1338 SDslu, 1173 SDs, 0 SdLazy, 3485 SolverSat, 1640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2228.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5295 GetRequests, 4961 SyntacticMatches, 3 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4576 ImplicationChecksByTransitivity, 3245.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=12, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 186.0ms AutomataMinimizationTime, 12 MinimizatonAttempts, 111 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 306.4ms SsaConstructionTime, 1817.4ms SatisfiabilityAnalysisTime, 19529.7ms InterpolantComputationTime, 8928 NumberOfCodeBlocks, 7994 NumberOfCodeBlocksAsserted, 174 NumberOfCheckSat, 7697 ConstructedInterpolants, 0 QuantifiedInterpolants, 10169 SizeOfPredicates, 53 NumberOfNonLiveVariables, 6696 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 393728/431468 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! [2021-08-26 08:46:46,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...