./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:30:27,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:30:27,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:30:27,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:30:27,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:30:27,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:30:27,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:30:27,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:30:27,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:30:27,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:30:27,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:30:27,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:30:27,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:30:27,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:30:27,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:30:27,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:30:27,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:30:27,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:30:27,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:30:27,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:30:27,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:30:27,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:30:27,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:30:27,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:30:27,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:30:27,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:30:27,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:30:27,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:30:27,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:30:27,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:30:27,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:30:27,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:30:27,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:30:27,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:30:27,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:30:27,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:30:27,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:30:27,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:30:27,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:30:27,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:30:27,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:30:27,376 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:30:27,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:30:27,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:30:27,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:30:27,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:30:27,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:30:27,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:30:27,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:30:27,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:30:27,396 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:30:27,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:30:27,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:30:27,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:30:27,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:30:27,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:30:27,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:30:27,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:30:27,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:30:27,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:30:27,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:30:27,399 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:30:27,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:30:27,399 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:30:27,399 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2022-12-13 19:30:27,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:30:27,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:30:27,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:30:27,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:30:27,614 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:30:27,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/recursive/Fibonacci04.c [2022-12-13 19:30:30,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:30:30,344 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:30:30,344 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/sv-benchmarks/c/recursive/Fibonacci04.c [2022-12-13 19:30:30,350 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/data/74b01e7b9/48a4f599d3c54889a2f9e051ffe3a7c2/FLAGde3af30d9 [2022-12-13 19:30:30,360 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/data/74b01e7b9/48a4f599d3c54889a2f9e051ffe3a7c2 [2022-12-13 19:30:30,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:30:30,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:30:30,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:30:30,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:30:30,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:30:30,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b06f157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30, skipping insertion in model container [2022-12-13 19:30:30,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:30:30,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:30:30,488 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2022-12-13 19:30:30,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:30:30,498 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:30:30,509 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2022-12-13 19:30:30,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:30:30,519 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:30:30,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30 WrapperNode [2022-12-13 19:30:30,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:30:30,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:30:30,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:30:30,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:30:30,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,542 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-12-13 19:30:30,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:30:30,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:30:30,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:30:30,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:30:30,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,553 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:30:30,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:30:30,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:30:30,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:30:30,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (1/1) ... [2022-12-13 19:30:30,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:30:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:30:30,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:30:30,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:30:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-12-13 19:30:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-12-13 19:30:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:30:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:30:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:30:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:30:30,661 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:30:30,663 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:30:30,731 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:30:30,736 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:30:30,736 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:30:30,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:30:30 BoogieIcfgContainer [2022-12-13 19:30:30,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:30:30,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:30:30,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:30:30,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:30:30,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:30:30" (1/3) ... [2022-12-13 19:30:30,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bb3640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:30:30, skipping insertion in model container [2022-12-13 19:30:30,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:30" (2/3) ... [2022-12-13 19:30:30,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bb3640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:30:30, skipping insertion in model container [2022-12-13 19:30:30,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:30:30" (3/3) ... [2022-12-13 19:30:30,744 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2022-12-13 19:30:30,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:30:30,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:30:30,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:30:30,801 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;@4e34d6ee, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:30:30,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 19:30:30,804 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-12-13 19:30:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 19:30:30,810 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:30,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:30,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2022-12-13 19:30:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:30,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739859473] [2022-12-13 19:30:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:30:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:30:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:31,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739859473] [2022-12-13 19:30:31,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739859473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:31,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:31,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:30:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548671506] [2022-12-13 19:30:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:31,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:30:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:30:31,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:30:31,040 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-12-13 19:30:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:30:31,108 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-12-13 19:30:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:30:31,110 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-12-13 19:30:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:30:31,116 INFO L225 Difference]: With dead ends: 31 [2022-12-13 19:30:31,116 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 19:30:31,118 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-12-13 19:30:31,120 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:30:31,121 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.0s Time] [2022-12-13 19:30:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 19:30:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 19:30:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 19:30:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-13 19:30:31,149 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-12-13 19:30:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:30:31,149 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-13 19:30:31,149 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-12-13 19:30:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-13 19:30:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 19:30:31,150 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:31,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:31,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:30:31,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2022-12-13 19:30:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:31,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533354245] [2022-12-13 19:30:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:30:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:30:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:31,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533354245] [2022-12-13 19:30:31,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533354245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:31,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:31,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:30:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230878926] [2022-12-13 19:30:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:31,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:30:31,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:30:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:30:31,226 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-12-13 19:30:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:30:31,269 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-12-13 19:30:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:30:31,278 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-12-13 19:30:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:30:31,279 INFO L225 Difference]: With dead ends: 24 [2022-12-13 19:30:31,279 INFO L226 Difference]: Without dead ends: 20 [2022-12-13 19:30:31,280 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-12-13 19:30:31,281 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-12-13 19:30:31,282 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-12-13 19:30:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-13 19:30:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-13 19:30:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 19:30:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-13 19:30:31,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-12-13 19:30:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:30:31,289 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-13 19:30:31,289 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-12-13 19:30:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-13 19:30:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 19:30:31,290 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:31,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:31,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:30:31,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2022-12-13 19:30:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957928115] [2022-12-13 19:30:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:30:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 19:30:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:30:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957928115] [2022-12-13 19:30:31,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957928115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:30:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162578077] [2022-12-13 19:30:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:30:31,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:30:31,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:30:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:31,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:30:31,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:30:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:30:31,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:30:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:30:31,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162578077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:30:31,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:30:31,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-12-13 19:30:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501911404] [2022-12-13 19:30:31,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:30:31,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 19:30:31,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 19:30:31,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-13 19:30:31,684 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-12-13 19:30:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:30:31,825 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-12-13 19:30:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:30:31,825 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-12-13 19:30:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:30:31,827 INFO L225 Difference]: With dead ends: 46 [2022-12-13 19:30:31,827 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 19:30:31,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-12-13 19:30:31,829 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:30:31,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 63 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:30:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 19:30:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-13 19:30:31,835 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-12-13 19:30:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-12-13 19:30:31,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-12-13 19:30:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:30:31,837 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-12-13 19:30:31,837 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-12-13 19:30:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-12-13 19:30:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 19:30:31,839 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:31,839 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-12-13 19:30:31,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:30:32,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:32,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2022-12-13 19:30:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:32,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811504294] [2022-12-13 19:30:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:30:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 19:30:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 19:30:32,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:32,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811504294] [2022-12-13 19:30:32,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811504294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:30:32,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961672147] [2022-12-13 19:30:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:30:32,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:30:32,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:30:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:32,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:30:32,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:30:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-13 19:30:32,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:30:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-13 19:30:32,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961672147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:30:32,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:30:32,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-12-13 19:30:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150884661] [2022-12-13 19:30:32,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:30:32,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:30:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:30:32,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:30:32,898 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-12-13 19:30:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:30:33,038 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-12-13 19:30:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 19:30:33,039 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-12-13 19:30:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:30:33,042 INFO L225 Difference]: With dead ends: 73 [2022-12-13 19:30:33,042 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 19:30:33,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2022-12-13 19:30:33,044 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:30:33,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:30:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 19:30:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-13 19:30:33,052 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, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2022-12-13 19:30:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-12-13 19:30:33,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2022-12-13 19:30:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:30:33,053 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-12-13 19:30:33,053 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-12-13 19:30:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2022-12-13 19:30:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-13 19:30:33,055 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:33,055 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:33,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:30:33,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:33,257 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash -878098806, now seen corresponding path program 2 times [2022-12-13 19:30:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:33,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296281853] [2022-12-13 19:30:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:30:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 19:30:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 19:30:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 19:30:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 19:30:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 19:30:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 19:30:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 100 proven. 219 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2022-12-13 19:30:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296281853] [2022-12-13 19:30:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296281853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:30:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325812599] [2022-12-13 19:30:33,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:30:33,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:33,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:30:33,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:30:33,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:30:33,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:30:33,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:30:33,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:30:33,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:30:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 263 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2022-12-13 19:30:33,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:30:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 275 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2022-12-13 19:30:34,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325812599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:30:34,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:30:34,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2022-12-13 19:30:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197038938] [2022-12-13 19:30:34,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:30:34,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:30:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:34,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:30:34,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:30:34,372 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-12-13 19:30:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:30:34,544 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-12-13 19:30:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 19:30:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 144 [2022-12-13 19:30:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:30:34,547 INFO L225 Difference]: With dead ends: 101 [2022-12-13 19:30:34,547 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 19:30:34,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 319 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2022-12-13 19:30:34,548 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:30:34,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:30:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 19:30:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-12-13 19:30:34,554 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, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-12-13 19:30:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-12-13 19:30:34,554 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 144 [2022-12-13 19:30:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:30:34,555 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-12-13 19:30:34,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-12-13 19:30:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-12-13 19:30:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-13 19:30:34,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:34,556 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:34,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:30:34,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:34,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 3 times [2022-12-13 19:30:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:34,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024091530] [2022-12-13 19:30:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:30:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 19:30:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 19:30:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 19:30:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 19:30:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 19:30:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:30:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 19:30:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 19:30:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2022-12-13 19:30:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:35,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024091530] [2022-12-13 19:30:35,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024091530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:30:35,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648371682] [2022-12-13 19:30:35,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:30:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:30:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:30:35,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:30:35,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:30:35,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-12-13 19:30:35,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:30:35,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:30:35,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:30:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2022-12-13 19:30:35,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:30:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2022-12-13 19:30:35,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648371682] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:30:35,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:30:35,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2022-12-13 19:30:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747716391] [2022-12-13 19:30:35,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:30:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:30:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:30:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:30:35,738 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2022-12-13 19:30:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:30:35,890 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2022-12-13 19:30:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:30:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) Word has length 147 [2022-12-13 19:30:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:30:35,892 INFO L225 Difference]: With dead ends: 101 [2022-12-13 19:30:35,892 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 19:30:35,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2022-12-13 19:30:35,894 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:30:35,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 129 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:30:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 19:30:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-13 19:30:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-13 19:30:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-12-13 19:30:35,901 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 147 [2022-12-13 19:30:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:30:35,902 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-12-13 19:30:35,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2022-12-13 19:30:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-12-13 19:30:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 19:30:35,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:30:35,904 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:35,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:30:36,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 19:30:36,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:30:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 4 times [2022-12-13 19:30:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:36,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915470944] [2022-12-13 19:30:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:30:36,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:30:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:30:36,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:30:36,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:30:36,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 19:30:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:30:36,179 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-12-13 19:30:36,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:30:36,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:30:36 BoogieIcfgContainer [2022-12-13 19:30:36,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:30:36,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:30:36,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:30:36,226 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:30:36,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:30:30" (3/4) ... [2022-12-13 19:30:36,228 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 19:30:36,270 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:30:36,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:30:36,271 INFO L158 Benchmark]: Toolchain (without parser) took 5908.28ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 103.6MB in the beginning and 63.5MB in the end (delta: 40.1MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2022-12-13 19:30:36,271 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:30:36,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.22ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 93.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:30:36,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.96ms. Allocated memory is still 144.7MB. Free memory was 93.2MB in the beginning and 92.1MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:30:36,271 INFO L158 Benchmark]: Boogie Preprocessor took 12.07ms. Allocated memory is still 144.7MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:30:36,272 INFO L158 Benchmark]: RCFGBuilder took 182.82ms. Allocated memory is still 144.7MB. Free memory was 91.1MB in the beginning and 81.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:30:36,272 INFO L158 Benchmark]: TraceAbstraction took 5485.17ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 80.5MB in the beginning and 66.7MB in the end (delta: 13.9MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2022-12-13 19:30:36,272 INFO L158 Benchmark]: Witness Printer took 45.19ms. Allocated memory is still 190.8MB. Free memory was 66.7MB in the beginning and 63.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:30:36,273 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.20ms. Allocated memory is still 144.7MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.22ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 93.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.96ms. Allocated memory is still 144.7MB. Free memory was 93.2MB in the beginning and 92.1MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.07ms. Allocated memory is still 144.7MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 182.82ms. Allocated memory is still 144.7MB. Free memory was 91.1MB in the beginning and 81.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5485.17ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 80.5MB in the beginning and 66.7MB in the end (delta: 13.9MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * Witness Printer took 45.19ms. Allocated memory is still 190.8MB. Free memory was 66.7MB in the beginning and 63.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 451 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 746 IncrementalHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 105 mSDtfsCounter, 746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 838 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 885 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1874 SizeOfPredicates, 12 NumberOfNonLiveVariables, 813 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 6248/7404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 19:30:36,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9359dc1-b2b9-45c2-9119-d0c1bc5ef27e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE