./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R --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 ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:16:12,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:16:12,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:16:12,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:16:12,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:16:12,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:16:12,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:16:12,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:16:12,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:16:12,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:16:12,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:16:12,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:16:12,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:16:12,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:16:12,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:16:12,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:16:12,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:16:12,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:16:12,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:16:12,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:16:12,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:16:12,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:16:12,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:16:12,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:16:12,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:16:12,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:16:12,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:16:12,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:16:12,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:16:12,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:16:12,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:16:12,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:16:12,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:16:12,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:16:12,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:16:12,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:16:12,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:16:12,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:16:12,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:16:12,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:16:12,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:16:12,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:16:12,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:16:12,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:16:12,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:16:12,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:16:12,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:16:12,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:16:12,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:16:12,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:16:12,811 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:16:12,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:16:12,812 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:16:12,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:16:12,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:16:12,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:16:12,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:16:12,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:16:12,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:16:12,814 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:16:12,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:16:12,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:16:12,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:16:12,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:16:12,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:16:12,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:16:12,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:16:12,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:16:12,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:16:12,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:16:12,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:16:12,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:16:12,819 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:16:12,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:16:12,820 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:16:12,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:16:12,820 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2022-11-25 18:16:13,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:16:13,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:16:13,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:16:13,175 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:16:13,176 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:16:13,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2022-11-25 18:16:16,516 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:16:16,732 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:16:16,732 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2022-11-25 18:16:16,739 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/data/e6efb63ca/ff338b6a590d4c2aadc3d6bdcabc9c4a/FLAG4d86ad0d7 [2022-11-25 18:16:16,753 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/data/e6efb63ca/ff338b6a590d4c2aadc3d6bdcabc9c4a [2022-11-25 18:16:16,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:16:16,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:16:16,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:16:16,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:16:16,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:16:16,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:16:16" (1/1) ... [2022-11-25 18:16:16,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcff9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:16, skipping insertion in model container [2022-11-25 18:16:16,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:16:16" (1/1) ... [2022-11-25 18:16:16,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:16:16,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:16:16,993 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2022-11-25 18:16:16,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:16:17,013 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:16:17,037 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2022-11-25 18:16:17,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:16:17,055 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:16:17,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17 WrapperNode [2022-11-25 18:16:17,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:16:17,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:16:17,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:16:17,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:16:17,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,096 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-25 18:16:17,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:16:17,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:16:17,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:16:17,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:16:17,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:16:17,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:16:17,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:16:17,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:16:17,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (1/1) ... [2022-11-25 18:16:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:16:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:17,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:16:17,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:16:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:16:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:16:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-11-25 18:16:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-11-25 18:16:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-11-25 18:16:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-11-25 18:16:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:16:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:16:17,314 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:16:17,319 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:16:17,535 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:16:17,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:16:17,553 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:16:17,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:16:17 BoogieIcfgContainer [2022-11-25 18:16:17,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:16:17,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:16:17,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:16:17,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:16:17,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:16:16" (1/3) ... [2022-11-25 18:16:17,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff8b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:16:17, skipping insertion in model container [2022-11-25 18:16:17,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:17" (2/3) ... [2022-11-25 18:16:17,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff8b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:16:17, skipping insertion in model container [2022-11-25 18:16:17,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:16:17" (3/3) ... [2022-11-25 18:16:17,577 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2022-11-25 18:16:17,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:16:17,614 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:16:17,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:16:17,687 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@693173bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:16:17,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:16:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:16:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 18:16:17,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:17,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:17,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-11-25 18:16:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:17,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145630678] [2022-11-25 18:16:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:18,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145630678] [2022-11-25 18:16:18,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145630678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:18,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:18,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:16:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119902180] [2022-11-25 18:16:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:18,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:16:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:16:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:16:18,109 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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) [2022-11-25 18:16:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:18,224 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-11-25 18:16:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:16:18,227 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 [2022-11-25 18:16:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:18,237 INFO L225 Difference]: With dead ends: 43 [2022-11-25 18:16:18,238 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 18:16:18,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:16:18,263 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:18,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 18:16:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 18:16:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-25 18:16:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-25 18:16:18,327 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-11-25 18:16:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:18,328 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-25 18:16:18,328 INFO L496 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) [2022-11-25 18:16:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-25 18:16:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 18:16:18,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:18,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:18,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:16:18,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-11-25 18:16:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18426720] [2022-11-25 18:16:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:18,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18426720] [2022-11-25 18:16:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18426720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:18,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:18,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:16:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017868184] [2022-11-25 18:16:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:18,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:16:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:16:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:16:18,514 INFO L87 Difference]: Start difference. First operand 27 states and 34 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) [2022-11-25 18:16:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:18,552 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-25 18:16:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:16:18,553 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 [2022-11-25 18:16:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:18,559 INFO L225 Difference]: With dead ends: 33 [2022-11-25 18:16:18,559 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 18:16:18,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:16:18,562 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:18,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:16:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 18:16:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-25 18:16:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-25 18:16:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-25 18:16:18,571 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-11-25 18:16:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:18,571 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-25 18:16:18,572 INFO L496 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) [2022-11-25 18:16:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-25 18:16:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:16:18,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:18,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:18,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:16:18,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-11-25 18:16:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:18,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837969444] [2022-11-25 18:16:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:16:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:16:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837969444] [2022-11-25 18:16:18,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837969444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:18,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17278017] [2022-11-25 18:16:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:18,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:18,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:18,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:16:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:19,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:16:19,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:16:19,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:16:19,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17278017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:19,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:19,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-11-25 18:16:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988874076] [2022-11-25 18:16:19,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:19,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:16:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:16:19,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:16:19,501 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:16:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:19,755 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-11-25 18:16:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:16:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-11-25 18:16:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:19,761 INFO L225 Difference]: With dead ends: 55 [2022-11-25 18:16:19,761 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 18:16:19,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:16:19,764 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:19,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 18:16:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-25 18:16:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-25 18:16:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-25 18:16:19,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-11-25 18:16:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:19,774 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-25 18:16:19,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:16:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-25 18:16:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:16:19,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:19,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:19,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:19,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:19,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-11-25 18:16:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:19,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391971404] [2022-11-25 18:16:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:16:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:20,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391971404] [2022-11-25 18:16:20,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391971404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:20,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840364428] [2022-11-25 18:16:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:20,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:20,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:20,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:16:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:20,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:16:20,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:16:20,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:16:20,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840364428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:20,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:20,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-11-25 18:16:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063013883] [2022-11-25 18:16:20,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:20,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:16:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:20,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:16:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:16:20,591 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 18:16:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:20,755 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-11-25 18:16:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:16:20,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-11-25 18:16:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:20,758 INFO L225 Difference]: With dead ends: 51 [2022-11-25 18:16:20,758 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 18:16:20,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:16:20,760 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:20,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 18:16:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-11-25 18:16:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 18:16:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-11-25 18:16:20,770 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-11-25 18:16:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:20,770 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-11-25 18:16:20,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 18:16:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-11-25 18:16:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 18:16:20,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:20,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:20,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:20,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:20,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-11-25 18:16:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:20,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955072924] [2022-11-25 18:16:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:16:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:16:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:16:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:21,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955072924] [2022-11-25 18:16:21,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955072924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:21,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729603773] [2022-11-25 18:16:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:21,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:21,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:21,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:21,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:16:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:21,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:16:21,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:16:21,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:16:21,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729603773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:21,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:21,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-11-25 18:16:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171037911] [2022-11-25 18:16:21,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:16:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:16:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:16:21,647 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 18:16:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:21,903 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-11-25 18:16:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:16:21,904 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-11-25 18:16:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:21,911 INFO L225 Difference]: With dead ends: 105 [2022-11-25 18:16:21,911 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 18:16:21,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:16:21,917 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:21,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 95 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:16:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 18:16:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 18:16:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-11-25 18:16:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-11-25 18:16:21,945 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-11-25 18:16:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:21,947 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-11-25 18:16:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 18:16:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-11-25 18:16:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:16:21,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:21,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:21,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:22,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:22,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-11-25 18:16:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:22,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988993761] [2022-11-25 18:16:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 18:16:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:22,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988993761] [2022-11-25 18:16:22,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988993761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:22,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865369623] [2022-11-25 18:16:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:22,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:22,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:22,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:22,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:16:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:22,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:16:22,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:16:22,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:16:22,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865369623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:22,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:22,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-11-25 18:16:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397286382] [2022-11-25 18:16:22,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:22,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:16:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:16:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:16:22,908 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 18:16:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:23,423 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-11-25 18:16:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:16:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2022-11-25 18:16:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:23,430 INFO L225 Difference]: With dead ends: 177 [2022-11-25 18:16:23,430 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 18:16:23,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:16:23,432 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:23,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:16:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 18:16:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-11-25 18:16:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-11-25 18:16:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-11-25 18:16:23,455 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-11-25 18:16:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:23,455 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-11-25 18:16:23,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 18:16:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-11-25 18:16:23,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:16:23,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:23,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:23,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:23,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:16:23,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-11-25 18:16:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:23,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593305790] [2022-11-25 18:16:23,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:24,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:16:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:16:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593305790] [2022-11-25 18:16:24,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593305790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:24,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937065306] [2022-11-25 18:16:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:24,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:24,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:24,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:16:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:24,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:16:24,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:16:24,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:16:24,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937065306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:24,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:24,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-11-25 18:16:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500368569] [2022-11-25 18:16:24,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:24,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:16:24,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:16:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:16:24,901 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-25 18:16:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:25,519 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-11-25 18:16:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:16:25,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2022-11-25 18:16:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:25,522 INFO L225 Difference]: With dead ends: 255 [2022-11-25 18:16:25,522 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 18:16:25,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:16:25,525 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:25,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:16:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 18:16:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-11-25 18:16:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2022-11-25 18:16:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-11-25 18:16:25,563 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-11-25 18:16:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:25,563 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-11-25 18:16:25,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-25 18:16:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-11-25 18:16:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 18:16:25,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:25,571 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:25,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:25,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:25,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-11-25 18:16:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:25,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475328769] [2022-11-25 18:16:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:25,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:16:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-25 18:16:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475328769] [2022-11-25 18:16:26,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475328769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:26,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157164009] [2022-11-25 18:16:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:26,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:26,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:26,252 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:26,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:16:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:26,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:16:26,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-25 18:16:26,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-25 18:16:27,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157164009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:27,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:27,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-11-25 18:16:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103851971] [2022-11-25 18:16:27,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:27,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:16:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:16:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:16:27,597 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-11-25 18:16:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:28,279 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-11-25 18:16:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:16:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2022-11-25 18:16:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:28,282 INFO L225 Difference]: With dead ends: 240 [2022-11-25 18:16:28,282 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 18:16:28,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 194 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 18:16:28,285 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:28,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 209 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:16:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 18:16:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-11-25 18:16:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2022-11-25 18:16:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-25 18:16:28,312 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-11-25 18:16:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:28,312 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-25 18:16:28,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-11-25 18:16:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-25 18:16:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-25 18:16:28,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:28,315 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:28,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:28,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:28,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:28,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-11-25 18:16:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:28,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848937464] [2022-11-25 18:16:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:28,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:16:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 18:16:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-11-25 18:16:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848937464] [2022-11-25 18:16:29,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848937464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:29,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481583690] [2022-11-25 18:16:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:29,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:29,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:29,229 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:29,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:16:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:29,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:16:29,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-11-25 18:16:29,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-25 18:16:31,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481583690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:31,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:31,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-11-25 18:16:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344423645] [2022-11-25 18:16:31,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:31,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:16:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:16:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:16:31,143 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-11-25 18:16:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:31,870 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-11-25 18:16:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:16:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2022-11-25 18:16:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:31,873 INFO L225 Difference]: With dead ends: 214 [2022-11-25 18:16:31,873 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 18:16:31,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 320 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 18:16:31,875 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 71 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:31,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 235 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:16:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 18:16:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-11-25 18:16:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2022-11-25 18:16:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-11-25 18:16:31,888 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-11-25 18:16:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:31,889 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-11-25 18:16:31,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-11-25 18:16:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-11-25 18:16:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-25 18:16:31,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:31,893 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:31,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 18:16:32,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 18:16:32,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-11-25 18:16:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:32,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922637343] [2022-11-25 18:16:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 18:16:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 18:16:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 18:16:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2022-11-25 18:16:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:33,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922637343] [2022-11-25 18:16:33,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922637343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:33,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191480344] [2022-11-25 18:16:33,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:16:33,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:33,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:33,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:33,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:16:33,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:16:33,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:33,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 18:16:33,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-11-25 18:16:33,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-11-25 18:16:36,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191480344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:36,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:36,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2022-11-25 18:16:36,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748230176] [2022-11-25 18:16:36,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:36,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 18:16:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 18:16:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-11-25 18:16:36,105 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2022-11-25 18:16:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:36,960 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-11-25 18:16:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:16:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 271 [2022-11-25 18:16:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:36,964 INFO L225 Difference]: With dead ends: 260 [2022-11-25 18:16:36,964 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 18:16:36,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 599 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 18:16:36,967 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:36,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 273 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:16:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 18:16:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-11-25 18:16:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2022-11-25 18:16:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-11-25 18:16:36,983 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-11-25 18:16:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:36,984 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-11-25 18:16:36,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2022-11-25 18:16:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-11-25 18:16:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2022-11-25 18:16:36,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:36,993 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 25, 25, 22, 22, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 10, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:37,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:37,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:16:37,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:37,201 INFO L85 PathProgramCache]: Analyzing trace with hash -854779469, now seen corresponding path program 3 times [2022-11-25 18:16:37,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:37,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356704063] [2022-11-25 18:16:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:16:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 18:16:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 18:16:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 245 proven. 607 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2022-11-25 18:16:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:38,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356704063] [2022-11-25 18:16:38,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356704063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:38,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345154726] [2022-11-25 18:16:38,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:16:38,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:38,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:38,990 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:38,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:16:39,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-25 18:16:39,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:16:39,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 726 proven. 42 refuted. 0 times theorem prover too weak. 3318 trivial. 0 not checked. [2022-11-25 18:16:39,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 726 proven. 43 refuted. 0 times theorem prover too weak. 3317 trivial. 0 not checked. [2022-11-25 18:16:41,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345154726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:41,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:41,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 26 [2022-11-25 18:16:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157218915] [2022-11-25 18:16:41,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:41,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:16:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:16:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:16:41,064 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 15 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) [2022-11-25 18:16:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:41,598 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2022-11-25 18:16:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:16:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 15 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) Word has length 378 [2022-11-25 18:16:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:41,603 INFO L225 Difference]: With dead ends: 308 [2022-11-25 18:16:41,604 INFO L226 Difference]: Without dead ends: 168 [2022-11-25 18:16:41,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 849 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 18:16:41,606 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:41,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 246 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:16:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-25 18:16:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2022-11-25 18:16:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 112 states have internal predecessors, (132), 32 states have call successors, (32), 24 states have call predecessors, (32), 16 states have return successors, (79), 28 states have call predecessors, (79), 32 states have call successors, (79) [2022-11-25 18:16:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2022-11-25 18:16:41,625 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 378 [2022-11-25 18:16:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:41,625 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2022-11-25 18:16:41,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 15 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) [2022-11-25 18:16:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2022-11-25 18:16:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2022-11-25 18:16:41,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:41,643 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 42, 42, 37, 34, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 16, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:41,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:41,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 18:16:41,849 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1952053737, now seen corresponding path program 4 times [2022-11-25 18:16:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:41,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55311794] [2022-11-25 18:16:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:43,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 18:16:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-25 18:16:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 18:16:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 367 proven. 1344 refuted. 0 times theorem prover too weak. 8684 trivial. 0 not checked. [2022-11-25 18:16:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:44,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55311794] [2022-11-25 18:16:44,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55311794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:44,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972171068] [2022-11-25 18:16:44,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:16:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:44,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:44,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:16:45,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:16:45,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:45,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:16:45,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 201 proven. 1550 refuted. 0 times theorem prover too weak. 8644 trivial. 0 not checked. [2022-11-25 18:16:45,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 201 proven. 1583 refuted. 0 times theorem prover too weak. 8611 trivial. 0 not checked. [2022-11-25 18:16:49,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972171068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:49,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 19] total 33 [2022-11-25 18:16:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306502187] [2022-11-25 18:16:49,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:49,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 18:16:49,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 18:16:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:16:49,429 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 33 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (34), 1 states have call predecessors, (34), 13 states have return successors, (44), 18 states have call predecessors, (44), 27 states have call successors, (44) [2022-11-25 18:16:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:50,572 INFO L93 Difference]: Finished difference Result 382 states and 633 transitions. [2022-11-25 18:16:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:16:50,573 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (34), 1 states have call predecessors, (34), 13 states have return successors, (44), 18 states have call predecessors, (44), 27 states have call successors, (44) Word has length 597 [2022-11-25 18:16:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:50,577 INFO L225 Difference]: With dead ends: 382 [2022-11-25 18:16:50,577 INFO L226 Difference]: Without dead ends: 220 [2022-11-25 18:16:50,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1403 GetRequests, 1344 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=437, Invalid=2319, Unknown=0, NotChecked=0, Total=2756 [2022-11-25 18:16:50,581 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:50,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 316 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:16:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-25 18:16:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2022-11-25 18:16:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 140 states have (on average 1.1428571428571428) internal successors, (160), 137 states have internal predecessors, (160), 41 states have call successors, (41), 30 states have call predecessors, (41), 18 states have return successors, (101), 32 states have call predecessors, (101), 41 states have call successors, (101) [2022-11-25 18:16:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 302 transitions. [2022-11-25 18:16:50,605 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 302 transitions. Word has length 597 [2022-11-25 18:16:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:50,605 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 302 transitions. [2022-11-25 18:16:50,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (34), 1 states have call predecessors, (34), 13 states have return successors, (44), 18 states have call predecessors, (44), 27 states have call successors, (44) [2022-11-25 18:16:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2022-11-25 18:16:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2022-11-25 18:16:50,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:50,637 INFO L195 NwaCegarLoop]: trace histogram [59, 59, 58, 58, 47, 47, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 18, 18, 12, 11, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:50,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:50,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:16:50,844 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1941284234, now seen corresponding path program 5 times [2022-11-25 18:16:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:50,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732353735] [2022-11-25 18:16:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:50,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:16:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 18:16:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:16:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 18:16:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 554 [2022-11-25 18:16:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:16:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:16:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:16:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:16:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 678 proven. 2278 refuted. 0 times theorem prover too weak. 15910 trivial. 0 not checked. [2022-11-25 18:16:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732353735] [2022-11-25 18:16:55,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732353735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489662502] [2022-11-25 18:16:55,332 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:16:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:55,335 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:55,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:16:55,729 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2022-11-25 18:16:55,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:55,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 18:16:55,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 10301 proven. 414 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2022-11-25 18:16:56,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 1631 proven. 1673 refuted. 0 times theorem prover too weak. 15562 trivial. 0 not checked. [2022-11-25 18:17:00,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489662502] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:00,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:00,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 21] total 41 [2022-11-25 18:17:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101074256] [2022-11-25 18:17:00,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:00,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 18:17:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 18:17:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 18:17:00,905 INFO L87 Difference]: Start difference. First operand 200 states and 302 transitions. Second operand has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 29 states have call successors, (42), 2 states have call predecessors, (42), 17 states have return successors, (54), 26 states have call predecessors, (54), 29 states have call successors, (54) [2022-11-25 18:17:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:02,208 INFO L93 Difference]: Finished difference Result 441 states and 709 transitions. [2022-11-25 18:17:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:17:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 29 states have call successors, (42), 2 states have call predecessors, (42), 17 states have return successors, (54), 26 states have call predecessors, (54), 29 states have call successors, (54) Word has length 800 [2022-11-25 18:17:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:02,214 INFO L225 Difference]: With dead ends: 441 [2022-11-25 18:17:02,215 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 18:17:02,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1872 GetRequests, 1804 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=513, Invalid=3027, Unknown=0, NotChecked=0, Total=3540 [2022-11-25 18:17:02,218 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 98 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:02,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 598 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:17:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 18:17:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2022-11-25 18:17:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.05) internal successors, (168), 154 states have internal predecessors, (168), 45 states have call successors, (45), 37 states have call predecessors, (45), 18 states have return successors, (106), 32 states have call predecessors, (106), 45 states have call successors, (106) [2022-11-25 18:17:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 319 transitions. [2022-11-25 18:17:02,247 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 319 transitions. Word has length 800 [2022-11-25 18:17:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:02,247 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 319 transitions. [2022-11-25 18:17:02,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 29 states have call successors, (42), 2 states have call predecessors, (42), 17 states have return successors, (54), 26 states have call predecessors, (54), 29 states have call successors, (54) [2022-11-25 18:17:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 319 transitions. [2022-11-25 18:17:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2022-11-25 18:17:02,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:02,254 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 45, 45, 38, 37, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 15, 14, 11, 7, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:02,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:17:02,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:17:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1548197760, now seen corresponding path program 6 times [2022-11-25 18:17:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:02,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533701255] [2022-11-25 18:17:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:17:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-11-25 18:17:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-11-25 18:17:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 1049 proven. 1539 refuted. 0 times theorem prover too weak. 9281 trivial. 0 not checked. [2022-11-25 18:17:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533701255] [2022-11-25 18:17:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533701255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:05,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449499604] [2022-11-25 18:17:05,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:17:05,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:05,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:05,750 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:05,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:17:06,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-11-25 18:17:06,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:17:06,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:17:06,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 483 proven. 1404 refuted. 0 times theorem prover too weak. 9982 trivial. 0 not checked. [2022-11-25 18:17:06,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 485 proven. 1435 refuted. 0 times theorem prover too weak. 9949 trivial. 0 not checked. [2022-11-25 18:17:09,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449499604] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:09,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:09,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 19] total 43 [2022-11-25 18:17:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458671599] [2022-11-25 18:17:09,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:09,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 18:17:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 18:17:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2022-11-25 18:17:09,900 INFO L87 Difference]: Start difference. First operand 224 states and 319 transitions. Second operand has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 29 states have call successors, (37), 1 states have call predecessors, (37), 20 states have return successors, (50), 30 states have call predecessors, (50), 29 states have call successors, (50) [2022-11-25 18:17:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:11,667 INFO L93 Difference]: Finished difference Result 552 states and 888 transitions. [2022-11-25 18:17:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-25 18:17:11,667 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 29 states have call successors, (37), 1 states have call predecessors, (37), 20 states have return successors, (50), 30 states have call predecessors, (50), 29 states have call successors, (50) Word has length 637 [2022-11-25 18:17:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:11,677 INFO L225 Difference]: With dead ends: 552 [2022-11-25 18:17:11,677 INFO L226 Difference]: Without dead ends: 324 [2022-11-25 18:17:11,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1432 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=841, Invalid=5165, Unknown=0, NotChecked=0, Total=6006 [2022-11-25 18:17:11,681 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 164 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:11,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 412 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:17:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-25 18:17:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 248. [2022-11-25 18:17:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 177 states have (on average 1.0451977401129944) internal successors, (185), 171 states have internal predecessors, (185), 50 states have call successors, (50), 41 states have call predecessors, (50), 20 states have return successors, (117), 35 states have call predecessors, (117), 50 states have call successors, (117) [2022-11-25 18:17:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2022-11-25 18:17:11,706 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 637 [2022-11-25 18:17:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:11,707 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2022-11-25 18:17:11,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 29 states have call successors, (37), 1 states have call predecessors, (37), 20 states have return successors, (50), 30 states have call predecessors, (50), 29 states have call successors, (50) [2022-11-25 18:17:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2022-11-25 18:17:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2022-11-25 18:17:11,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:11,718 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 75, 75, 62, 60, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 25, 22, 15, 14, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:11,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:11,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:11,931 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:17:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1161748685, now seen corresponding path program 7 times [2022-11-25 18:17:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52529922] [2022-11-25 18:17:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:17:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-25 18:17:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:17:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2022-11-25 18:17:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-11-25 18:17:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:17:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 18:17:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:17:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:17:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1986 proven. 3188 refuted. 0 times theorem prover too weak. 26463 trivial. 0 not checked. [2022-11-25 18:17:16,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:16,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52529922] [2022-11-25 18:17:16,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52529922] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:16,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819755680] [2022-11-25 18:17:16,960 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:17:16,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:16,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:16,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:16,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:17:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:17,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 18:17:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1449 proven. 2506 refuted. 0 times theorem prover too weak. 27682 trivial. 0 not checked. [2022-11-25 18:17:17,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1451 proven. 2556 refuted. 0 times theorem prover too weak. 27630 trivial. 0 not checked. [2022-11-25 18:17:23,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819755680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:17:23,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:17:23,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 15, 23] total 48 [2022-11-25 18:17:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471374977] [2022-11-25 18:17:23,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:23,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 18:17:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 18:17:23,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 18:17:23,915 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand has 48 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 48 states have internal predecessors, (129), 36 states have call successors, (43), 1 states have call predecessors, (43), 20 states have return successors, (60), 32 states have call predecessors, (60), 36 states have call successors, (60) [2022-11-25 18:17:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:25,824 INFO L93 Difference]: Finished difference Result 535 states and 870 transitions. [2022-11-25 18:17:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:17:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 48 states have internal predecessors, (129), 36 states have call successors, (43), 1 states have call predecessors, (43), 20 states have return successors, (60), 32 states have call predecessors, (60), 36 states have call successors, (60) Word has length 1032 [2022-11-25 18:17:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:25,830 INFO L225 Difference]: With dead ends: 535 [2022-11-25 18:17:25,830 INFO L226 Difference]: Without dead ends: 270 [2022-11-25 18:17:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2419 GetRequests, 2336 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=708, Invalid=4694, Unknown=0, NotChecked=0, Total=5402 [2022-11-25 18:17:25,835 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 157 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:25,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 738 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 18:17:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-25 18:17:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 246. [2022-11-25 18:17:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 175 states have (on average 1.0457142857142858) internal successors, (183), 170 states have internal predecessors, (183), 51 states have call successors, (51), 41 states have call predecessors, (51), 19 states have return successors, (69), 34 states have call predecessors, (69), 51 states have call successors, (69) [2022-11-25 18:17:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 303 transitions. [2022-11-25 18:17:25,859 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 303 transitions. Word has length 1032 [2022-11-25 18:17:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:25,860 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 303 transitions. [2022-11-25 18:17:25,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 48 states have internal predecessors, (129), 36 states have call successors, (43), 1 states have call predecessors, (43), 20 states have return successors, (60), 32 states have call predecessors, (60), 36 states have call successors, (60) [2022-11-25 18:17:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 303 transitions. [2022-11-25 18:17:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-11-25 18:17:25,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:25,874 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:25,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:26,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:26,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:17:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 8 times [2022-11-25 18:17:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366205780] [2022-11-25 18:17:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:17:26,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:17:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:17:26,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:17:26,802 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:17:26,804 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:17:26,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:17:26,810 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:26,817 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:17:27,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:17:27 BoogieIcfgContainer [2022-11-25 18:17:27,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:17:27,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:17:27,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:17:27,058 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:17:27,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:16:17" (3/4) ... [2022-11-25 18:17:27,062 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:17:27,300 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:17:27,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:17:27,301 INFO L158 Benchmark]: Toolchain (without parser) took 70542.93ms. Allocated memory was 182.5MB in the beginning and 960.5MB in the end (delta: 778.0MB). Free memory was 138.7MB in the beginning and 447.7MB in the end (delta: -309.0MB). Peak memory consumption was 471.7MB. Max. memory is 16.1GB. [2022-11-25 18:17:27,301 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:17:27,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.13ms. Allocated memory is still 182.5MB. Free memory was 138.3MB in the beginning and 128.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:17:27,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.91ms. Allocated memory is still 182.5MB. Free memory was 128.2MB in the beginning and 127.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:17:27,303 INFO L158 Benchmark]: Boogie Preprocessor took 48.33ms. Allocated memory is still 182.5MB. Free memory was 127.0MB in the beginning and 126.1MB in the end (delta: 853.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:17:27,304 INFO L158 Benchmark]: RCFGBuilder took 409.77ms. Allocated memory is still 182.5MB. Free memory was 125.7MB in the beginning and 116.1MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:17:27,304 INFO L158 Benchmark]: TraceAbstraction took 69497.50ms. Allocated memory was 182.5MB in the beginning and 960.5MB in the end (delta: 778.0MB). Free memory was 115.2MB in the beginning and 474.2MB in the end (delta: -359.0MB). Peak memory consumption was 421.4MB. Max. memory is 16.1GB. [2022-11-25 18:17:27,304 INFO L158 Benchmark]: Witness Printer took 242.58ms. Allocated memory is still 960.5MB. Free memory was 474.2MB in the beginning and 447.7MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:17:27,311 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.30ms. Allocated memory is still 134.2MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.13ms. Allocated memory is still 182.5MB. Free memory was 138.3MB in the beginning and 128.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.91ms. Allocated memory is still 182.5MB. Free memory was 128.2MB in the beginning and 127.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.33ms. Allocated memory is still 182.5MB. Free memory was 127.0MB in the beginning and 126.1MB in the end (delta: 853.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.77ms. Allocated memory is still 182.5MB. Free memory was 125.7MB in the beginning and 116.1MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 69497.50ms. Allocated memory was 182.5MB in the beginning and 960.5MB in the end (delta: 778.0MB). Free memory was 115.2MB in the beginning and 474.2MB in the end (delta: -359.0MB). Peak memory consumption was 421.4MB. Max. memory is 16.1GB. * Witness Printer took 242.58ms. Allocated memory is still 960.5MB. Free memory was 474.2MB in the beginning and 447.7MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.1s, OverallIterations: 16, TraceHistogramMax: 89, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1099 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1030 mSDsluCounter, 4020 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3516 mSDsCounter, 1620 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10435 IncrementalHoareTripleChecker+Invalid, 12055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1620 mSolverCounterUnsat, 504 mSDtfsCounter, 10435 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9826 GetRequests, 9240 SyntacticMatches, 76 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8091 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=14, InterpolantAutomatonStates: 378, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 257 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 50.4s InterpolantComputationTime, 9484 NumberOfCodeBlocks, 8533 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 12361 ConstructedInterpolants, 0 QuantifiedInterpolants, 16655 SizeOfPredicates, 72 NumberOfNonLiveVariables, 7250 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 214606/239181 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! [2022-11-25 18:17:27,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_378716b0-d97c-4196-9613-cc3d048b3b47/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE