./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8 --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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- 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-2329fc7 [2022-12-13 17:50:05,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:50:05,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:50:05,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:50:05,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:50:05,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:50:05,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:50:05,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:50:05,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:50:05,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:50:05,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:50:05,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:50:05,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:50:05,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:50:05,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:50:05,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:50:05,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:50:05,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:50:05,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:50:05,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:50:05,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:50:05,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:50:05,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:50:05,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:50:05,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:50:05,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:50:05,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:50:05,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:50:05,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:50:05,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:50:05,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:50:05,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:50:05,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:50:05,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:50:05,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:50:05,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:50:05,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:50:05,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:50:05,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:50:05,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:50:05,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:50:05,204 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:50:05,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:50:05,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:50:05,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:50:05,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:50:05,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:50:05,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:50:05,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:50:05,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:50:05,232 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:50:05,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:50:05,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:50:05,234 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:50:05,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:50:05,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:50:05,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:50:05,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:50:05,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:50:05,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:50:05,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:50:05,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:50:05,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:50:05,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:50:05,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:50:05,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:50:05,236 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:50:05,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:50:05,236 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:50:05,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:50:05,236 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:50:05,236 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_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/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_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2022-12-13 17:50:05,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:50:05,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:50:05,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:50:05,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:50:05,414 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:50:05,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-12-13 17:50:08,006 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:50:08,144 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:50:08,144 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-12-13 17:50:08,148 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/data/bad2d6774/030cd4f95d1343bdaf153e6f4c8d3d56/FLAGe7cff42ca [2022-12-13 17:50:08,158 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/data/bad2d6774/030cd4f95d1343bdaf153e6f4c8d3d56 [2022-12-13 17:50:08,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:50:08,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:50:08,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:50:08,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:50:08,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:50:08,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3c749d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08, skipping insertion in model container [2022-12-13 17:50:08,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:50:08,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:50:08,315 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_fdad2994-286a-44ee-b680-a1e807923e93/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-12-13 17:50:08,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:50:08,326 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:50:08,336 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_fdad2994-286a-44ee-b680-a1e807923e93/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-12-13 17:50:08,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:50:08,347 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:50:08,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08 WrapperNode [2022-12-13 17:50:08,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:50:08,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:50:08,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:50:08,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:50:08,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,369 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-12-13 17:50:08,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:50:08,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:50:08,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:50:08,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:50:08,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,381 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:50:08,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:50:08,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:50:08,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:50:08,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (1/1) ... [2022-12-13 17:50:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:50:08,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:08,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:50:08,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:50:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:50:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:50:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:50:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:50:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-12-13 17:50:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-12-13 17:50:08,503 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:50:08,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:50:08,573 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:50:08,578 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:50:08,578 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:50:08,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:50:08 BoogieIcfgContainer [2022-12-13 17:50:08,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:50:08,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:50:08,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:50:08,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:50:08,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:50:08" (1/3) ... [2022-12-13 17:50:08,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cb55e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:50:08, skipping insertion in model container [2022-12-13 17:50:08,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:50:08" (2/3) ... [2022-12-13 17:50:08,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cb55e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:50:08, skipping insertion in model container [2022-12-13 17:50:08,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:50:08" (3/3) ... [2022-12-13 17:50:08,588 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2022-12-13 17:50:08,603 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:50:08,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:50:08,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:50:08,645 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;@2076a23, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:50:08,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:50:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:50:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 17:50:08,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:08,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:08,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-12-13 17:50:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:08,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077271888] [2022-12-13 17:50:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:50:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077271888] [2022-12-13 17:50:08,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077271888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:50:08,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:50:08,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:50:08,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675670096] [2022-12-13 17:50:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:50:08,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:50:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:50:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:50:08,902 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:50:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:08,949 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-12-13 17:50:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:50:08,953 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-12-13 17:50:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:08,960 INFO L225 Difference]: With dead ends: 34 [2022-12-13 17:50:08,961 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 17:50:08,963 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-12-13 17:50:08,967 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:08,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:50:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 17:50:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 17:50:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:50:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-13 17:50:09,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-12-13 17:50:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:09,002 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-13 17:50:09,002 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-12-13 17:50:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-13 17:50:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 17:50:09,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:09,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:09,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:50:09,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-12-13 17:50:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:09,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969786479] [2022-12-13 17:50:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:50:09,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969786479] [2022-12-13 17:50:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969786479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:50:09,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:50:09,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:50:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121934256] [2022-12-13 17:50:09,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:50:09,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:50:09,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:09,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:50:09,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:50:09,102 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:50:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:09,127 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-12-13 17:50:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:50:09,128 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-12-13 17:50:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:09,129 INFO L225 Difference]: With dead ends: 24 [2022-12-13 17:50:09,129 INFO L226 Difference]: Without dead ends: 20 [2022-12-13 17:50:09,129 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-12-13 17:50:09,131 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 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-12-13 17:50:09,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:50:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-13 17:50:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-13 17:50:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:50:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-13 17:50:09,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-12-13 17:50:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:09,138 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-13 17:50:09,138 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-12-13 17:50:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-13 17:50:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 17:50:09,139 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:09,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:50:09,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-12-13 17:50:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:09,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902744057] [2022-12-13 17:50:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 17:50:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:50:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902744057] [2022-12-13 17:50:09,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902744057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793068769] [2022-12-13 17:50:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:09,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:09,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:09,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:50:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:50:09,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:50:09,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:50:09,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793068769] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:09,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:09,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-12-13 17:50:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948690665] [2022-12-13 17:50:09,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 17:50:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 17:50:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:50:09,542 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-12-13 17:50:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:09,621 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-12-13 17:50:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:50:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-12-13 17:50:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:09,623 INFO L225 Difference]: With dead ends: 35 [2022-12-13 17:50:09,623 INFO L226 Difference]: Without dead ends: 20 [2022-12-13 17:50:09,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:50:09,625 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:09,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 48 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:50:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-13 17:50:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-12-13 17:50:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:50:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-12-13 17:50:09,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-12-13 17:50:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:09,631 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-12-13 17:50:09,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-12-13 17:50:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-12-13 17:50:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 17:50:09,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:09,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:09,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:50:09,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:09,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:09,837 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-12-13 17:50:09,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:09,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702983963] [2022-12-13 17:50:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:09,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:50:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702983963] [2022-12-13 17:50:10,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702983963] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:10,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409802825] [2022-12-13 17:50:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:10,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:10,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:50:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:50:10,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:50:10,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:50:10,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409802825] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:10,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:10,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-12-13 17:50:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085480257] [2022-12-13 17:50:10,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:10,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:50:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:10,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:50:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:50:10,237 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-12-13 17:50:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:10,299 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-12-13 17:50:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:50:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-12-13 17:50:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:10,301 INFO L225 Difference]: With dead ends: 38 [2022-12-13 17:50:10,301 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 17:50:10,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:50:10,302 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:10,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:50:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 17:50:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 17:50:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-12-13 17:50:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-12-13 17:50:10,308 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-12-13 17:50:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:10,308 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-12-13 17:50:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-12-13 17:50:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-12-13 17:50:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 17:50:10,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:10,311 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:10,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:50:10,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:10,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-12-13 17:50:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963901424] [2022-12-13 17:50:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 17:50:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:10,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963901424] [2022-12-13 17:50:10,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963901424] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:10,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133029091] [2022-12-13 17:50:10,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:50:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:10,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:10,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:50:10,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:50:10,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:10,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:50:10,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 17:50:10,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 17:50:11,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133029091] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:11,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:11,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-12-13 17:50:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982920295] [2022-12-13 17:50:11,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:11,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 17:50:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 17:50:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:50:11,126 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-13 17:50:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:11,239 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-12-13 17:50:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:50:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-12-13 17:50:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:11,241 INFO L225 Difference]: With dead ends: 69 [2022-12-13 17:50:11,241 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 17:50:11,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:50:11,243 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:11,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 77 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:50:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 17:50:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-13 17:50:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 17:50:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-12-13 17:50:11,249 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-12-13 17:50:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:11,249 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-12-13 17:50:11,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-13 17:50:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-12-13 17:50:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 17:50:11,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:11,250 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:11,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:50:11,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:11,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -721858190, now seen corresponding path program 3 times [2022-12-13 17:50:11,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:11,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622745791] [2022-12-13 17:50:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-12-13 17:50:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622745791] [2022-12-13 17:50:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622745791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758781875] [2022-12-13 17:50:11,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:50:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:11,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:11,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:50:11,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-12-13 17:50:11,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:11,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:50:11,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-12-13 17:50:12,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 17:50:12,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758781875] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:12,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:12,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2022-12-13 17:50:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143759013] [2022-12-13 17:50:12,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:12,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 17:50:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 17:50:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:50:12,303 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-12-13 17:50:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:12,524 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2022-12-13 17:50:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:50:12,524 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 93 [2022-12-13 17:50:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:12,527 INFO L225 Difference]: With dead ends: 89 [2022-12-13 17:50:12,527 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 17:50:12,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 199 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2022-12-13 17:50:12,528 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:12,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 97 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:50:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 17:50:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-12-13 17:50:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-13 17:50:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-12-13 17:50:12,539 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 93 [2022-12-13 17:50:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:12,539 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-12-13 17:50:12,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-12-13 17:50:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-12-13 17:50:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-13 17:50:12,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:12,542 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:12,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 17:50:12,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:12,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1447005449, now seen corresponding path program 4 times [2022-12-13 17:50:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004798703] [2022-12-13 17:50:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-12-13 17:50:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004798703] [2022-12-13 17:50:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004798703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547341943] [2022-12-13 17:50:13,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:50:13,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:13,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:13,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:50:13,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:50:13,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:13,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:50:13,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-12-13 17:50:13,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-12-13 17:50:14,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547341943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:14,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:14,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 13] total 27 [2022-12-13 17:50:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677015112] [2022-12-13 17:50:14,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:14,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 17:50:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 17:50:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:50:14,103 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 27 states, 25 states have (on average 2.68) internal successors, (67), 27 states have internal predecessors, (67), 20 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (31), 16 states have call predecessors, (31), 20 states have call successors, (31) [2022-12-13 17:50:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:14,355 INFO L93 Difference]: Finished difference Result 116 states and 179 transitions. [2022-12-13 17:50:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 17:50:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.68) internal successors, (67), 27 states have internal predecessors, (67), 20 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (31), 16 states have call predecessors, (31), 20 states have call successors, (31) Word has length 133 [2022-12-13 17:50:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:14,357 INFO L225 Difference]: With dead ends: 116 [2022-12-13 17:50:14,358 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 17:50:14,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 291 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 17:50:14,360 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:14,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 132 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:50:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 17:50:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-12-13 17:50:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 46 states have internal predecessors, (53), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-12-13 17:50:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-12-13 17:50:14,370 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 133 [2022-12-13 17:50:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:14,371 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-12-13 17:50:14,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.68) internal successors, (67), 27 states have internal predecessors, (67), 20 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (31), 16 states have call predecessors, (31), 20 states have call successors, (31) [2022-12-13 17:50:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-12-13 17:50:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-13 17:50:14,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:14,374 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:14,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:50:14,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:14,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:14,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1694816164, now seen corresponding path program 5 times [2022-12-13 17:50:14,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902217676] [2022-12-13 17:50:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-12-13 17:50:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902217676] [2022-12-13 17:50:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902217676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683086239] [2022-12-13 17:50:15,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 17:50:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:15,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:15,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:50:15,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-12-13 17:50:15,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:15,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 17:50:15,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2022-12-13 17:50:15,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2022-12-13 17:50:15,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683086239] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:15,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:15,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 21 [2022-12-13 17:50:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442656808] [2022-12-13 17:50:15,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:15,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 17:50:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:15,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 17:50:15,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:50:15,696 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 21 states have internal predecessors, (54), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (24), 15 states have call predecessors, (24), 14 states have call successors, (24) [2022-12-13 17:50:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:15,830 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2022-12-13 17:50:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:50:15,830 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 21 states have internal predecessors, (54), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (24), 15 states have call predecessors, (24), 14 states have call successors, (24) Word has length 174 [2022-12-13 17:50:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:15,833 INFO L225 Difference]: With dead ends: 183 [2022-12-13 17:50:15,834 INFO L226 Difference]: Without dead ends: 179 [2022-12-13 17:50:15,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 387 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:50:15,834 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:15,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 91 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:50:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-13 17:50:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2022-12-13 17:50:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.1130434782608696) internal successors, (128), 110 states have internal predecessors, (128), 33 states have call successors, (33), 19 states have call predecessors, (33), 18 states have return successors, (86), 37 states have call predecessors, (86), 33 states have call successors, (86) [2022-12-13 17:50:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2022-12-13 17:50:15,856 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 174 [2022-12-13 17:50:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:15,856 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2022-12-13 17:50:15,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 21 states have internal predecessors, (54), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (24), 15 states have call predecessors, (24), 14 states have call successors, (24) [2022-12-13 17:50:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-12-13 17:50:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-12-13 17:50:15,860 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:15,860 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:15,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 17:50:16,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 17:50:16,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2022-12-13 17:50:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875819560] [2022-12-13 17:50:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 17:50:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2022-12-13 17:50:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:17,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875819560] [2022-12-13 17:50:17,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875819560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:17,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970210246] [2022-12-13 17:50:17,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 17:50:17,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:17,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:17,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:50:17,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-12-13 17:50:17,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:17,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 17:50:17,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2022-12-13 17:50:17,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 360 proven. 1160 refuted. 0 times theorem prover too weak. 5600 trivial. 0 not checked. [2022-12-13 17:50:18,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970210246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:18,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:18,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 15] total 33 [2022-12-13 17:50:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021654513] [2022-12-13 17:50:18,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:18,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 17:50:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:18,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 17:50:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 17:50:18,669 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand has 33 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 33 states have internal predecessors, (81), 23 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2022-12-13 17:50:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:19,003 INFO L93 Difference]: Finished difference Result 276 states and 477 transitions. [2022-12-13 17:50:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 17:50:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 33 states have internal predecessors, (81), 23 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) Word has length 351 [2022-12-13 17:50:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:19,005 INFO L225 Difference]: With dead ends: 276 [2022-12-13 17:50:19,005 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 17:50:19,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 789 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=623, Invalid=1927, Unknown=0, NotChecked=0, Total=2550 [2022-12-13 17:50:19,007 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 120 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:19,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 185 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:50:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 17:50:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2022-12-13 17:50:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 67 states have internal predecessors, (76), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (41), 15 states have call predecessors, (41), 18 states have call successors, (41) [2022-12-13 17:50:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2022-12-13 17:50:19,018 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 351 [2022-12-13 17:50:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:19,018 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2022-12-13 17:50:19,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 33 states have internal predecessors, (81), 23 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2022-12-13 17:50:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2022-12-13 17:50:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2022-12-13 17:50:19,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:19,032 INFO L195 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:19,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 17:50:19,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:19,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2022-12-13 17:50:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:19,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794845583] [2022-12-13 17:50:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 17:50:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 17:50:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 17:50:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2022-12-13 17:50:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794845583] [2022-12-13 17:50:21,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794845583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121104816] [2022-12-13 17:50:21,118 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 17:50:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:21,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:21,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:50:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:21,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:50:21,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2022-12-13 17:50:21,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 3019 refuted. 0 times theorem prover too weak. 15683 trivial. 0 not checked. [2022-12-13 17:50:23,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121104816] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:23,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:23,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 19] total 39 [2022-12-13 17:50:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138032571] [2022-12-13 17:50:23,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 17:50:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:23,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 17:50:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 17:50:23,278 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 30 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (50), 26 states have call predecessors, (50), 30 states have call successors, (50) [2022-12-13 17:50:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:23,840 INFO L93 Difference]: Finished difference Result 220 states and 377 transitions. [2022-12-13 17:50:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 17:50:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 30 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (50), 26 states have call predecessors, (50), 30 states have call successors, (50) Word has length 569 [2022-12-13 17:50:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:23,844 INFO L225 Difference]: With dead ends: 220 [2022-12-13 17:50:23,844 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 17:50:23,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1285 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=2789, Unknown=0, NotChecked=0, Total=3660 [2022-12-13 17:50:23,845 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 172 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:23,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 231 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:50:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 17:50:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-12-13 17:50:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 79 states have internal predecessors, (88), 22 states have call successors, (22), 17 states have call predecessors, (22), 10 states have return successors, (53), 17 states have call predecessors, (53), 22 states have call successors, (53) [2022-12-13 17:50:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2022-12-13 17:50:23,853 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 569 [2022-12-13 17:50:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:23,853 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2022-12-13 17:50:23,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 30 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (50), 26 states have call predecessors, (50), 30 states have call successors, (50) [2022-12-13 17:50:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2022-12-13 17:50:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2022-12-13 17:50:23,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:23,859 INFO L195 NwaCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:23,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 17:50:24,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 17:50:24,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2022-12-13 17:50:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:24,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410115874] [2022-12-13 17:50:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:25,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:25,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 17:50:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 17:50:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-12-13 17:50:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 17:50:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 17:50:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:50:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 17:50:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 17:50:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:50:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3273 proven. 6787 refuted. 0 times theorem prover too weak. 40850 trivial. 0 not checked. [2022-12-13 17:50:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410115874] [2022-12-13 17:50:26,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410115874] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890170857] [2022-12-13 17:50:26,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:50:26,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:26,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:26,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:26,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:50:27,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:50:27,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:27,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 17:50:27,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2022-12-13 17:50:27,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5722 refuted. 0 times theorem prover too weak. 44464 trivial. 0 not checked. [2022-12-13 17:50:30,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890170857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:50:30,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:50:30,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13, 21] total 43 [2022-12-13 17:50:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151744076] [2022-12-13 17:50:30,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:30,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-13 17:50:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:30,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-13 17:50:30,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 17:50:30,217 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 43 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 43 states have internal predecessors, (103), 33 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (56), 30 states have call predecessors, (56), 33 states have call successors, (56) [2022-12-13 17:50:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:30,828 INFO L93 Difference]: Finished difference Result 258 states and 453 transitions. [2022-12-13 17:50:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 17:50:30,828 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 43 states have internal predecessors, (103), 33 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (56), 30 states have call predecessors, (56), 33 states have call successors, (56) Word has length 923 [2022-12-13 17:50:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:30,831 INFO L225 Difference]: With dead ends: 258 [2022-12-13 17:50:30,831 INFO L226 Difference]: Without dead ends: 155 [2022-12-13 17:50:30,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2172 GetRequests, 2095 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1111, Invalid=3581, Unknown=0, NotChecked=0, Total=4692 [2022-12-13 17:50:30,833 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 189 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:30,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 249 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:50:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-13 17:50:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2022-12-13 17:50:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.075268817204301) internal successors, (100), 91 states have internal predecessors, (100), 26 states have call successors, (26), 20 states have call predecessors, (26), 11 states have return successors, (66), 19 states have call predecessors, (66), 26 states have call successors, (66) [2022-12-13 17:50:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2022-12-13 17:50:30,847 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 923 [2022-12-13 17:50:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:30,848 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2022-12-13 17:50:30,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 43 states have internal predecessors, (103), 33 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (56), 30 states have call predecessors, (56), 33 states have call successors, (56) [2022-12-13 17:50:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2022-12-13 17:50:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-12-13 17:50:30,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:30,858 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:50:30,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 17:50:31,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 17:50:31,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 9 times [2022-12-13 17:50:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:31,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195689882] [2022-12-13 17:50:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:50:31,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:50:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:50:31,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:50:31,435 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:50:31,436 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 17:50:31,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:50:31,440 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2022-12-13 17:50:31,444 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:50:31,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:50:31 BoogieIcfgContainer [2022-12-13 17:50:31,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:50:31,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:50:31,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:50:31,589 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:50:31,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:50:08" (3/4) ... [2022-12-13 17:50:31,591 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:50:31,732 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:50:31,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:50:31,733 INFO L158 Benchmark]: Toolchain (without parser) took 23571.21ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 110.0MB in the beginning and 364.2MB in the end (delta: -254.2MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2022-12-13 17:50:31,733 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:50:31,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.24ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 99.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:50:31,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.97ms. Allocated memory is still 151.0MB. Free memory was 99.9MB in the beginning and 98.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:50:31,734 INFO L158 Benchmark]: Boogie Preprocessor took 12.50ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:50:31,734 INFO L158 Benchmark]: RCFGBuilder took 197.22ms. Allocated memory is still 151.0MB. Free memory was 97.4MB in the beginning and 88.3MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:50:31,734 INFO L158 Benchmark]: TraceAbstraction took 23005.81ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 87.7MB in the beginning and 388.3MB in the end (delta: -300.6MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. [2022-12-13 17:50:31,735 INFO L158 Benchmark]: Witness Printer took 143.52ms. Allocated memory is still 461.4MB. Free memory was 388.3MB in the beginning and 364.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 17:50:31,737 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.18ms. Allocated memory is still 100.7MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.24ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 99.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.97ms. Allocated memory is still 151.0MB. Free memory was 99.9MB in the beginning and 98.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.50ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 197.22ms. Allocated memory is still 151.0MB. Free memory was 97.4MB in the beginning and 88.3MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23005.81ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 87.7MB in the beginning and 388.3MB in the end (delta: -300.6MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. * Witness Printer took 143.52ms. Allocated memory is still 461.4MB. Free memory was 388.3MB in the beginning and 364.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 12, TraceHistogramMax: 177, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 802 mSDsluCounter, 1321 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 1447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2701 IncrementalHoareTripleChecker+Invalid, 4148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1447 mSolverCounterUnsat, 244 mSDtfsCounter, 2701 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5577 GetRequests, 5224 SyntacticMatches, 44 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5024 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=8, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 90 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 5884 NumberOfCodeBlocks, 5642 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 6973 ConstructedInterpolants, 0 QuantifiedInterpolants, 10044 SizeOfPredicates, 42 NumberOfNonLiveVariables, 4806 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 207222/240657 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-12-13 17:50:31,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdad2994-286a-44ee-b680-a1e807923e93/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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