./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc --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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- 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-5e519f3 [2022-11-02 20:35:46,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:35:46,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:35:46,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:35:46,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:35:46,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:35:46,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:35:46,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:35:46,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:35:46,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:35:46,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:35:46,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:35:46,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:35:46,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:35:46,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:35:46,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:35:46,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:35:46,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:35:46,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:35:46,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:35:46,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:35:46,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:35:46,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:35:46,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:35:46,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:35:46,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:35:46,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:35:46,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:35:46,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:35:46,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:35:46,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:35:46,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:35:46,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:35:46,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:35:46,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:35:46,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:35:46,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:35:46,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:35:46,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:35:46,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:35:46,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:35:46,332 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:35:46,379 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:35:46,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:35:46,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:35:46,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:35:46,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:35:46,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:35:46,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:35:46,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:35:46,383 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:35:46,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:35:46,385 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:35:46,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:35:46,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:35:46,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:35:46,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:35:46,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:35:46,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:35:46,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:35:46,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:35:46,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:35:46,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:35:46,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:35:46,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:35:46,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:35:46,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:46,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:35:46,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:35:46,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:35:46,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:35:46,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:35:46,392 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:35:46,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:35:46,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:35:46,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/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_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2022-11-02 20:35:46,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:35:46,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:35:46,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:35:46,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:35:46,799 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:35:46,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/recursive/Fibonacci05.c [2022-11-02 20:35:46,892 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/data/f37dac3f4/04f25b41840343439fbffc08eac85c2e/FLAG841376fce [2022-11-02 20:35:47,362 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:35:47,363 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/sv-benchmarks/c/recursive/Fibonacci05.c [2022-11-02 20:35:47,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/data/f37dac3f4/04f25b41840343439fbffc08eac85c2e/FLAG841376fce [2022-11-02 20:35:47,761 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/data/f37dac3f4/04f25b41840343439fbffc08eac85c2e [2022-11-02 20:35:47,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:35:47,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:35:47,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:47,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:35:47,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:35:47,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff9afd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47, skipping insertion in model container [2022-11-02 20:35:47,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:47,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:35:47,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:35:48,079 WARN L230 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_d3f6a4d4-743a-4360-b793-73597f28d1d2/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-11-02 20:35:48,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:48,106 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:35:48,133 WARN L230 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_d3f6a4d4-743a-4360-b793-73597f28d1d2/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-11-02 20:35:48,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:48,155 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:35:48,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48 WrapperNode [2022-11-02 20:35:48,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:48,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:48,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:35:48,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:35:48,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,204 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-11-02 20:35:48,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:48,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:35:48,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:35:48,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:35:48,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,234 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:35:48,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:35:48,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:35:48,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:35:48,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (1/1) ... [2022-11-02 20:35:48,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:48,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:48,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:35:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-02 20:35:48,318 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-02 20:35:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:35:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:35:48,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:35:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:35:48,391 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:35:48,399 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:35:48,607 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:35:48,613 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:35:48,614 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:35:48,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:48 BoogieIcfgContainer [2022-11-02 20:35:48,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:35:48,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:35:48,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:35:48,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:35:48,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:35:47" (1/3) ... [2022-11-02 20:35:48,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37df8f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:48, skipping insertion in model container [2022-11-02 20:35:48,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:48" (2/3) ... [2022-11-02 20:35:48,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37df8f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:48, skipping insertion in model container [2022-11-02 20:35:48,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:48" (3/3) ... [2022-11-02 20:35:48,633 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2022-11-02 20:35:48,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:35:48,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:35:48,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:35:48,750 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;@33231685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:35:48,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:35:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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-11-02 20:35:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:35:48,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:48,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:48,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2022-11-02 20:35:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:48,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461152433] [2022-11-02 20:35:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:49,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461152433] [2022-11-02 20:35:49,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461152433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:49,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:49,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:35:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329738653] [2022-11-02 20:35:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:49,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:35:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:35:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:35:49,306 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:35:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:49,404 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-02 20:35:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:35:49,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-02 20:35:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:49,419 INFO L225 Difference]: With dead ends: 31 [2022-11-02 20:35:49,419 INFO L226 Difference]: Without dead ends: 18 [2022-11-02 20:35:49,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:35:49,431 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:49,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:35:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-02 20:35:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-02 20:35:49,491 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-11-02 20:35:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-02 20:35:49,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-02 20:35:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:49,498 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-02 20:35:49,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:35:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-02 20:35:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:35:49,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:49,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:49,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:35:49,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2022-11-02 20:35:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:49,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060169949] [2022-11-02 20:35:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:49,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060169949] [2022-11-02 20:35:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060169949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:49,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:49,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:35:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765419274] [2022-11-02 20:35:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:49,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:35:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:35:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:35:49,829 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), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:35:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:49,890 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-02 20:35:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:35:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-02 20:35:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:49,894 INFO L225 Difference]: With dead ends: 24 [2022-11-02 20:35:49,894 INFO L226 Difference]: Without dead ends: 20 [2022-11-02 20:35:49,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:35:49,903 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:49,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:35:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-02 20:35:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-02 20:35:49,919 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-11-02 20:35:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-02 20:35:49,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-02 20:35:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:49,927 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-02 20:35:49,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:35:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-02 20:35:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:35:49,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:49,933 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:49,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:35:49,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2022-11-02 20:35:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:49,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133396519] [2022-11-02 20:35:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:35:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:35:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:50,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133396519] [2022-11-02 20:35:50,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133396519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126865230] [2022-11-02 20:35:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:50,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:50,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:50,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:35:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:35:50,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:35:50,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:35:50,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126865230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:50,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:50,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-11-02 20:35:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543568476] [2022-11-02 20:35:50,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:50,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:35:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:35:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:35:50,722 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-02 20:35:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:51,018 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-11-02 20:35:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:35:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-11-02 20:35:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:51,023 INFO L225 Difference]: With dead ends: 46 [2022-11-02 20:35:51,024 INFO L226 Difference]: Without dead ends: 29 [2022-11-02 20:35:51,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:35:51,030 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:51,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 63 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:35:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-02 20:35:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-02 20:35:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-02 20:35:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-11-02 20:35:51,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-11-02 20:35:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:51,054 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-11-02 20:35:51,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-02 20:35:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-11-02 20:35:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:35:51,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:51,063 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:51,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:51,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-02 20:35:51,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2022-11-02 20:35:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:51,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134481328] [2022-11-02 20:35:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 20:35:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134481328] [2022-11-02 20:35:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134481328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701292147] [2022-11-02 20:35:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:51,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:51,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:35:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:52,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:35:52,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-02 20:35:52,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-02 20:35:52,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701292147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:52,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:52,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-11-02 20:35:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290129291] [2022-11-02 20:35:52,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:52,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:35:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:52,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:35:52,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:35:52,716 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-02 20:35:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:53,127 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2022-11-02 20:35:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:35:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2022-11-02 20:35:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:53,131 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:35:53,132 INFO L226 Difference]: Without dead ends: 44 [2022-11-02 20:35:53,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:35:53,134 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:53,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:35:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-02 20:35:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-02 20:35:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2022-11-02 20:35:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2022-11-02 20:35:53,158 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2022-11-02 20:35:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:53,159 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2022-11-02 20:35:53,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-02 20:35:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2022-11-02 20:35:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-02 20:35:53,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:53,176 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:53,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-02 20:35:53,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:53,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:53,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2022-11-02 20:35:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:53,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726442875] [2022-11-02 20:35:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:35:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:35:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:35:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:35:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-11-02 20:35:54,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:54,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726442875] [2022-11-02 20:35:54,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726442875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:54,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201785289] [2022-11-02 20:35:54,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:35:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:54,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:54,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:35:54,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:35:54,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:35:54,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:35:54,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-11-02 20:35:55,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2022-11-02 20:35:56,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201785289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:56,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:56,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2022-11-02 20:35:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255757309] [2022-11-02 20:35:56,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:35:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:35:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:35:56,251 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-11-02 20:35:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:57,034 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2022-11-02 20:35:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 20:35:57,035 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2022-11-02 20:35:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:57,038 INFO L225 Difference]: With dead ends: 119 [2022-11-02 20:35:57,038 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:35:57,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 20:35:57,041 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:57,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 108 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:35:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:35:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-11-02 20:35:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2022-11-02 20:35:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2022-11-02 20:35:57,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2022-11-02 20:35:57,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:57,065 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2022-11-02 20:35:57,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-11-02 20:35:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2022-11-02 20:35:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-11-02 20:35:57,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:57,084 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-11-02 20:35:57,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:57,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:57,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2022-11-02 20:35:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:57,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415237867] [2022-11-02 20:35:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:35:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:35:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:35:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:35:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:35:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:35:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:35:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:35:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:35:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:35:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:35:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:35:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2022-11-02 20:35:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:59,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415237867] [2022-11-02 20:35:59,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415237867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:59,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751952984] [2022-11-02 20:35:59,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:35:59,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:59,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:59,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:59,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:35:59,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-11-02 20:35:59,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:35:59,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:35:59,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2022-11-02 20:35:59,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2022-11-02 20:36:02,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751952984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:02,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:02,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2022-11-02 20:36:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096650803] [2022-11-02 20:36:02,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:02,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:36:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:36:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:36:02,852 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2022-11-02 20:36:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:03,524 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2022-11-02 20:36:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:36:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2022-11-02 20:36:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:03,531 INFO L225 Difference]: With dead ends: 172 [2022-11-02 20:36:03,532 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:36:03,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 787 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2022-11-02 20:36:03,537 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:03,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 171 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:36:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:36:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2022-11-02 20:36:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2022-11-02 20:36:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2022-11-02 20:36:03,560 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2022-11-02 20:36:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:03,561 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-11-02 20:36:03,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2022-11-02 20:36:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2022-11-02 20:36:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-11-02 20:36:03,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:03,584 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:03,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:36:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:36:03,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2022-11-02 20:36:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:03,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444876271] [2022-11-02 20:36:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:36:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:36:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:36:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:36:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:36:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:36:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:36:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:36:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-02 20:36:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:36:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:36:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:36:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:36:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:36:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:36:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:36:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:36:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2022-11-02 20:36:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444876271] [2022-11-02 20:36:07,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444876271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962042698] [2022-11-02 20:36:07,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:36:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:07,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:07,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:36:07,934 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:36:07,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:36:07,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:36:07,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2022-11-02 20:36:08,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2022-11-02 20:36:13,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962042698] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:13,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:13,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2022-11-02 20:36:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232109349] [2022-11-02 20:36:13,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:13,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:36:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:36:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2022-11-02 20:36:13,981 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2022-11-02 20:36:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:15,086 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2022-11-02 20:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-02 20:36:15,087 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 528 [2022-11-02 20:36:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:15,091 INFO L225 Difference]: With dead ends: 217 [2022-11-02 20:36:15,091 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 20:36:15,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1184 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2022-11-02 20:36:15,095 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:15,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:36:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 20:36:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2022-11-02 20:36:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2022-11-02 20:36:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2022-11-02 20:36:15,114 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2022-11-02 20:36:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:15,115 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2022-11-02 20:36:15,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2022-11-02 20:36:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2022-11-02 20:36:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-11-02 20:36:15,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:15,126 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:15,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 20:36:15,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:15,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:15,348 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2022-11-02 20:36:15,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:15,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646822921] [2022-11-02 20:36:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:36:15,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:36:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:36:15,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:36:15,630 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:36:15,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:36:15,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:36:15,636 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-11-02 20:36:15,642 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:36:15,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:36:15 BoogieIcfgContainer [2022-11-02 20:36:15,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:36:15,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:36:15,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:36:15,802 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:36:15,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:48" (3/4) ... [2022-11-02 20:36:15,805 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:36:15,943 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:36:15,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:36:15,944 INFO L158 Benchmark]: Toolchain (without parser) took 28175.01ms. Allocated memory was 98.6MB in the beginning and 364.9MB in the end (delta: 266.3MB). Free memory was 59.7MB in the beginning and 292.2MB in the end (delta: -232.6MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-11-02 20:36:15,944 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 98.6MB. Free memory was 75.7MB in the beginning and 75.7MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:15,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.61ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 75.5MB in the end (delta: -16.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:36:15,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.79ms. Allocated memory is still 98.6MB. Free memory was 75.5MB in the beginning and 74.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:36:15,945 INFO L158 Benchmark]: Boogie Preprocessor took 31.38ms. Allocated memory is still 98.6MB. Free memory was 74.2MB in the beginning and 73.2MB in the end (delta: 947.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:15,946 INFO L158 Benchmark]: RCFGBuilder took 384.91ms. Allocated memory is still 98.6MB. Free memory was 72.9MB in the beginning and 63.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:36:15,946 INFO L158 Benchmark]: TraceAbstraction took 27176.08ms. Allocated memory was 98.6MB in the beginning and 364.9MB in the end (delta: 266.3MB). Free memory was 62.8MB in the beginning and 302.7MB in the end (delta: -239.9MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. [2022-11-02 20:36:15,947 INFO L158 Benchmark]: Witness Printer took 141.50ms. Allocated memory is still 364.9MB. Free memory was 302.7MB in the beginning and 292.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:36:15,949 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.34ms. Allocated memory is still 98.6MB. Free memory was 75.7MB in the beginning and 75.7MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.61ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 75.5MB in the end (delta: -16.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.79ms. Allocated memory is still 98.6MB. Free memory was 75.5MB in the beginning and 74.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.38ms. Allocated memory is still 98.6MB. Free memory was 74.2MB in the beginning and 73.2MB in the end (delta: 947.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 384.91ms. Allocated memory is still 98.6MB. Free memory was 72.9MB in the beginning and 63.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27176.08ms. Allocated memory was 98.6MB in the beginning and 364.9MB in the end (delta: 266.3MB). Free memory was 62.8MB in the beginning and 302.7MB in the end (delta: -239.9MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. * Witness Printer took 141.50ms. Allocated memory is still 364.9MB. Free memory was 302.7MB in the beginning and 292.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 634 mSDsCounter, 1166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1166 mSolverCounterUnsat, 141 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2548 SyntacticMatches, 30 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3419 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 139, 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, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:36:16,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3f6a4d4-743a-4360-b793-73597f28d1d2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE