./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.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_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/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_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/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_41b8ba59-4159-4e6d-803e-51919dbad310/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 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- 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 15:49:33,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:49:33,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:49:33,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:49:33,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:49:33,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:49:33,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:49:33,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:49:33,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:49:33,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:49:33,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:49:33,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:49:33,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:49:33,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:49:33,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:49:33,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:49:33,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:49:33,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:49:33,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:49:33,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:49:33,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:49:33,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:49:33,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:49:33,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:49:33,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:49:33,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:49:33,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:49:33,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:49:33,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:49:33,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:49:33,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:49:33,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:49:33,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:49:33,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:49:33,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:49:33,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:49:33,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:49:33,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:49:33,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:49:33,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:49:33,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:49:33,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 15:49:33,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:49:33,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:49:33,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:49:33,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:49:33,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:49:33,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:49:33,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:49:33,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:49:33,947 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:49:33,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:49:33,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:49:33,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:49:33,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:49:33,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:49:33,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:49:33,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:49:33,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:49:33,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:49:33,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:49:33,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:49:33,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:49:33,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:49:33,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:49:33,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:49:33,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:49:33,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:49:33,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:49:33,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:49:33,951 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:49:33,952 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_41b8ba59-4159-4e6d-803e-51919dbad310/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_41b8ba59-4159-4e6d-803e-51919dbad310/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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2022-12-13 15:49:34,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:49:34,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:49:34,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:49:34,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:49:34,145 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:49:34,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-12-13 15:49:36,838 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:49:37,042 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:49:37,042 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-12-13 15:49:37,053 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/data/81aeca591/a7c6bff2ad084cc78e76b346777d26dc/FLAG95c2aad44 [2022-12-13 15:49:37,404 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/data/81aeca591/a7c6bff2ad084cc78e76b346777d26dc [2022-12-13 15:49:37,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:49:37,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:49:37,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:49:37,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:49:37,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:49:37,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2c28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37, skipping insertion in model container [2022-12-13 15:49:37,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:49:37,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:49:37,570 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_41b8ba59-4159-4e6d-803e-51919dbad310/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-12-13 15:49:37,602 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_41b8ba59-4159-4e6d-803e-51919dbad310/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-12-13 15:49:37,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:49:37,633 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:49:37,641 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_41b8ba59-4159-4e6d-803e-51919dbad310/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-12-13 15:49:37,652 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_41b8ba59-4159-4e6d-803e-51919dbad310/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-12-13 15:49:37,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:49:37,676 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:49:37,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37 WrapperNode [2022-12-13 15:49:37,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:49:37,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:49:37,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:49:37,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:49:37,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,708 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 422 [2022-12-13 15:49:37,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:49:37,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:49:37,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:49:37,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:49:37,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,729 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:49:37,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:49:37,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:49:37,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:49:37,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (1/1) ... [2022-12-13 15:49:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:49:37,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:37,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:49:37,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:49:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:49:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 15:49:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 15:49:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-12-13 15:49:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-12-13 15:49:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 15:49:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 15:49:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 15:49:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 15:49:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 15:49:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-12-13 15:49:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-12-13 15:49:37,860 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:49:37,862 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:49:38,192 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:49:38,201 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:49:38,201 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 15:49:38,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:49:38 BoogieIcfgContainer [2022-12-13 15:49:38,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:49:38,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:49:38,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:49:38,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:49:38,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:49:37" (1/3) ... [2022-12-13 15:49:38,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163aab5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:49:38, skipping insertion in model container [2022-12-13 15:49:38,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:49:37" (2/3) ... [2022-12-13 15:49:38,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163aab5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:49:38, skipping insertion in model container [2022-12-13 15:49:38,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:49:38" (3/3) ... [2022-12-13 15:49:38,212 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-12-13 15:49:38,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:49:38,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 15:49:38,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:49:38,281 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;@1a85327d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:49:38,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 15:49:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-13 15:49:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 15:49:38,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:38,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:38,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 578004893, now seen corresponding path program 1 times [2022-12-13 15:49:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393768201] [2022-12-13 15:49:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 15:49:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:38,558 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 15:49:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393768201] [2022-12-13 15:49:38,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393768201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:38,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:38,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:49:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792579758] [2022-12-13 15:49:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:38,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:38,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:49:38,596 INFO L87 Difference]: Start difference. First operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:49:38,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:38,858 INFO L93 Difference]: Finished difference Result 429 states and 652 transitions. [2022-12-13 15:49:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:49:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-12-13 15:49:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:38,872 INFO L225 Difference]: With dead ends: 429 [2022-12-13 15:49:38,872 INFO L226 Difference]: Without dead ends: 246 [2022-12-13 15:49:38,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:38,880 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 297 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:38,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 438 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:49:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-13 15:49:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2022-12-13 15:49:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.42) internal successors, (284), 205 states have internal predecessors, (284), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-12-13 15:49:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2022-12-13 15:49:38,942 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 44 [2022-12-13 15:49:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:38,943 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2022-12-13 15:49:38,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:49:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2022-12-13 15:49:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 15:49:38,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:38,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:38,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:49:38,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1000349205, now seen corresponding path program 1 times [2022-12-13 15:49:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:38,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294711773] [2022-12-13 15:49:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:49:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,027 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 15:49:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:39,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294711773] [2022-12-13 15:49:39,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294711773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:39,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:39,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:49:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108060072] [2022-12-13 15:49:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:39,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:49:39,031 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:49:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:39,219 INFO L93 Difference]: Finished difference Result 488 states and 680 transitions. [2022-12-13 15:49:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:49:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 15:49:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:39,224 INFO L225 Difference]: With dead ends: 488 [2022-12-13 15:49:39,224 INFO L226 Difference]: Without dead ends: 364 [2022-12-13 15:49:39,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:39,227 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 150 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:39,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 546 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-12-13 15:49:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2022-12-13 15:49:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 261 states have (on average 1.4099616858237547) internal successors, (368), 266 states have internal predecessors, (368), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-12-13 15:49:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 430 transitions. [2022-12-13 15:49:39,258 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 430 transitions. Word has length 45 [2022-12-13 15:49:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:39,258 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 430 transitions. [2022-12-13 15:49:39,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:49:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 430 transitions. [2022-12-13 15:49:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 15:49:39,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:39,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:39,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:49:39,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -284008256, now seen corresponding path program 1 times [2022-12-13 15:49:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:39,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229623330] [2022-12-13 15:49:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:49:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,327 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 15:49:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:39,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229623330] [2022-12-13 15:49:39,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229623330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:39,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:39,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:49:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993497494] [2022-12-13 15:49:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:39,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:49:39,330 INFO L87 Difference]: Start difference. First operand 307 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:49:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:39,504 INFO L93 Difference]: Finished difference Result 715 states and 989 transitions. [2022-12-13 15:49:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:49:39,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 15:49:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:39,507 INFO L225 Difference]: With dead ends: 715 [2022-12-13 15:49:39,508 INFO L226 Difference]: Without dead ends: 524 [2022-12-13 15:49:39,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:39,510 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 306 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:39,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 428 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-12-13 15:49:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2022-12-13 15:49:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.371007371007371) internal successors, (558), 415 states have internal predecessors, (558), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-12-13 15:49:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 648 transitions. [2022-12-13 15:49:39,552 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 648 transitions. Word has length 45 [2022-12-13 15:49:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:39,553 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 648 transitions. [2022-12-13 15:49:39,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:49:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 648 transitions. [2022-12-13 15:49:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:49:39,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:39,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:39,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:49:39,556 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1712856217, now seen corresponding path program 1 times [2022-12-13 15:49:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:39,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843551494] [2022-12-13 15:49:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:39,623 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 15:49:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:39,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843551494] [2022-12-13 15:49:39,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843551494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:39,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:39,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:49:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544482776] [2022-12-13 15:49:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:39,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:39,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:39,626 INFO L87 Difference]: Start difference. First operand 472 states and 648 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:39,923 INFO L93 Difference]: Finished difference Result 596 states and 832 transitions. [2022-12-13 15:49:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:49:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-12-13 15:49:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:39,927 INFO L225 Difference]: With dead ends: 596 [2022-12-13 15:49:39,927 INFO L226 Difference]: Without dead ends: 493 [2022-12-13 15:49:39,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:49:39,929 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 285 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:39,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 465 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:49:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-12-13 15:49:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 472. [2022-12-13 15:49:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 415 states have internal predecessors, (557), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-12-13 15:49:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 647 transitions. [2022-12-13 15:49:39,971 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 647 transitions. Word has length 58 [2022-12-13 15:49:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:39,971 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 647 transitions. [2022-12-13 15:49:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2022-12-13 15:49:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:49:39,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:39,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:39,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:49:39,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:39,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1231775959, now seen corresponding path program 1 times [2022-12-13 15:49:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:39,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376021526] [2022-12-13 15:49:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,079 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 15:49:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376021526] [2022-12-13 15:49:40,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376021526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:40,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:40,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:49:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732228717] [2022-12-13 15:49:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:40,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:49:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:40,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:49:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:49:40,082 INFO L87 Difference]: Start difference. First operand 472 states and 647 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:40,545 INFO L93 Difference]: Finished difference Result 710 states and 998 transitions. [2022-12-13 15:49:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:49:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-12-13 15:49:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:40,549 INFO L225 Difference]: With dead ends: 710 [2022-12-13 15:49:40,549 INFO L226 Difference]: Without dead ends: 610 [2022-12-13 15:49:40,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:49:40,551 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 458 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:40,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 628 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 15:49:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-12-13 15:49:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 567. [2022-12-13 15:49:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 485 states have (on average 1.3855670103092783) internal successors, (672), 494 states have internal predecessors, (672), 51 states have call successors, (51), 28 states have call predecessors, (51), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-12-13 15:49:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 785 transitions. [2022-12-13 15:49:40,597 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 785 transitions. Word has length 58 [2022-12-13 15:49:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:40,598 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 785 transitions. [2022-12-13 15:49:40,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 785 transitions. [2022-12-13 15:49:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:49:40,599 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:40,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:40,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:49:40,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 696496743, now seen corresponding path program 1 times [2022-12-13 15:49:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246664114] [2022-12-13 15:49:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:40,718 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 15:49:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:40,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246664114] [2022-12-13 15:49:40,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246664114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:40,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:40,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:49:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090457533] [2022-12-13 15:49:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:40,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:49:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:49:40,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:40,719 INFO L87 Difference]: Start difference. First operand 567 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:41,290 INFO L93 Difference]: Finished difference Result 918 states and 1293 transitions. [2022-12-13 15:49:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 15:49:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-12-13 15:49:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:41,293 INFO L225 Difference]: With dead ends: 918 [2022-12-13 15:49:41,293 INFO L226 Difference]: Without dead ends: 723 [2022-12-13 15:49:41,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 15:49:41,294 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 455 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:41,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1000 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 15:49:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-12-13 15:49:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 657. [2022-12-13 15:49:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 558 states have (on average 1.39247311827957) internal successors, (777), 568 states have internal predecessors, (777), 61 states have call successors, (61), 34 states have call predecessors, (61), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-12-13 15:49:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 912 transitions. [2022-12-13 15:49:41,323 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 912 transitions. Word has length 58 [2022-12-13 15:49:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:41,324 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 912 transitions. [2022-12-13 15:49:41,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 912 transitions. [2022-12-13 15:49:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:49:41,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:41,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:41,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:49:41,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:41,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1589983081, now seen corresponding path program 1 times [2022-12-13 15:49:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773821677] [2022-12-13 15:49:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:41,407 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 15:49:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:41,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773821677] [2022-12-13 15:49:41,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773821677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:41,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:41,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:49:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156601925] [2022-12-13 15:49:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:41,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:49:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:49:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:41,409 INFO L87 Difference]: Start difference. First operand 657 states and 912 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:41,996 INFO L93 Difference]: Finished difference Result 1244 states and 1756 transitions. [2022-12-13 15:49:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:49:41,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-12-13 15:49:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:42,002 INFO L225 Difference]: With dead ends: 1244 [2022-12-13 15:49:42,002 INFO L226 Difference]: Without dead ends: 959 [2022-12-13 15:49:42,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 15:49:42,003 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 448 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:42,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 984 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 15:49:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-12-13 15:49:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 815. [2022-12-13 15:49:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 684 states have (on average 1.394736842105263) internal successors, (954), 696 states have internal predecessors, (954), 79 states have call successors, (79), 46 states have call predecessors, (79), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-12-13 15:49:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1133 transitions. [2022-12-13 15:49:42,042 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1133 transitions. Word has length 58 [2022-12-13 15:49:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:42,043 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1133 transitions. [2022-12-13 15:49:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1133 transitions. [2022-12-13 15:49:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:49:42,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:42,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:42,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:49:42,044 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 692589803, now seen corresponding path program 1 times [2022-12-13 15:49:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:42,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908772239] [2022-12-13 15:49:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:42,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,106 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 15:49:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908772239] [2022-12-13 15:49:42,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908772239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:42,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:42,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:49:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244418660] [2022-12-13 15:49:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:49:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:49:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:49:42,108 INFO L87 Difference]: Start difference. First operand 815 states and 1133 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:42,611 INFO L93 Difference]: Finished difference Result 1642 states and 2326 transitions. [2022-12-13 15:49:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:49:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-12-13 15:49:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:42,616 INFO L225 Difference]: With dead ends: 1642 [2022-12-13 15:49:42,616 INFO L226 Difference]: Without dead ends: 1200 [2022-12-13 15:49:42,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 15:49:42,617 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 562 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:42,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 715 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 15:49:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-12-13 15:49:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1067. [2022-12-13 15:49:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 885 states have (on average 1.3887005649717514) internal successors, (1229), 902 states have internal predecessors, (1229), 110 states have call successors, (110), 64 states have call predecessors, (110), 70 states have return successors, (135), 104 states have call predecessors, (135), 106 states have call successors, (135) [2022-12-13 15:49:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1474 transitions. [2022-12-13 15:49:42,698 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1474 transitions. Word has length 58 [2022-12-13 15:49:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:42,698 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1474 transitions. [2022-12-13 15:49:42,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:49:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1474 transitions. [2022-12-13 15:49:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 15:49:42,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:42,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:42,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:49:42,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 228372173, now seen corresponding path program 1 times [2022-12-13 15:49:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:42,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266651561] [2022-12-13 15:49:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 15:49:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:49:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266651561] [2022-12-13 15:49:42,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266651561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:42,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:42,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:49:42,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105728327] [2022-12-13 15:49:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:42,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:49:42,742 INFO L87 Difference]: Start difference. First operand 1067 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:49:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:42,961 INFO L93 Difference]: Finished difference Result 1651 states and 2259 transitions. [2022-12-13 15:49:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:49:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-12-13 15:49:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:42,964 INFO L225 Difference]: With dead ends: 1651 [2022-12-13 15:49:42,965 INFO L226 Difference]: Without dead ends: 1295 [2022-12-13 15:49:42,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:42,966 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 134 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:42,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 595 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-12-13 15:49:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1257. [2022-12-13 15:49:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1051 states have (on average 1.3596574690770695) internal successors, (1429), 1070 states have internal predecessors, (1429), 124 states have call successors, (124), 72 states have call predecessors, (124), 80 states have return successors, (159), 118 states have call predecessors, (159), 120 states have call successors, (159) [2022-12-13 15:49:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1712 transitions. [2022-12-13 15:49:43,023 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1712 transitions. Word has length 62 [2022-12-13 15:49:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:43,023 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1712 transitions. [2022-12-13 15:49:43,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:49:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1712 transitions. [2022-12-13 15:49:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:49:43,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:43,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:43,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:49:43,025 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -387474386, now seen corresponding path program 1 times [2022-12-13 15:49:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:43,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712736638] [2022-12-13 15:49:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:49:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:49:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 15:49:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:43,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712736638] [2022-12-13 15:49:43,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712736638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:43,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:43,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:49:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834772305] [2022-12-13 15:49:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:43,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:49:43,066 INFO L87 Difference]: Start difference. First operand 1257 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 15:49:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:43,255 INFO L93 Difference]: Finished difference Result 1910 states and 2565 transitions. [2022-12-13 15:49:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:49:43,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-12-13 15:49:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:43,260 INFO L225 Difference]: With dead ends: 1910 [2022-12-13 15:49:43,260 INFO L226 Difference]: Without dead ends: 1456 [2022-12-13 15:49:43,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:43,261 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 292 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:43,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 424 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-12-13 15:49:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1401. [2022-12-13 15:49:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1179 states have (on average 1.3401187446988974) internal successors, (1580), 1200 states have internal predecessors, (1580), 132 states have call successors, (132), 78 states have call predecessors, (132), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-12-13 15:49:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1885 transitions. [2022-12-13 15:49:43,354 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1885 transitions. Word has length 67 [2022-12-13 15:49:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:43,354 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1885 transitions. [2022-12-13 15:49:43,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 15:49:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1885 transitions. [2022-12-13 15:49:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 15:49:43,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:43,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:43,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:49:43,357 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1207541004, now seen corresponding path program 1 times [2022-12-13 15:49:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:43,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568586642] [2022-12-13 15:49:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:49:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:49:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 15:49:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568586642] [2022-12-13 15:49:43,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568586642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705804601] [2022-12-13 15:49:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:43,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:43,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:43,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 15:49:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:43,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 15:49:43,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:43,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:49:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 15:49:43,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705804601] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:43,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:49:43,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-12-13 15:49:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837348506] [2022-12-13 15:49:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:43,634 INFO L87 Difference]: Start difference. First operand 1401 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:49:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:43,824 INFO L93 Difference]: Finished difference Result 1457 states and 1953 transitions. [2022-12-13 15:49:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:49:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-12-13 15:49:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:43,830 INFO L225 Difference]: With dead ends: 1457 [2022-12-13 15:49:43,831 INFO L226 Difference]: Without dead ends: 1454 [2022-12-13 15:49:43,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:49:43,832 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 419 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:43,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 340 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-12-13 15:49:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1400. [2022-12-13 15:49:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1179 states have (on average 1.3384223918575064) internal successors, (1578), 1199 states have internal predecessors, (1578), 131 states have call successors, (131), 78 states have call predecessors, (131), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-12-13 15:49:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1882 transitions. [2022-12-13 15:49:43,978 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1882 transitions. Word has length 68 [2022-12-13 15:49:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:43,978 INFO L495 AbstractCegarLoop]: Abstraction has 1400 states and 1882 transitions. [2022-12-13 15:49:43,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:49:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1882 transitions. [2022-12-13 15:49:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:49:43,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:43,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:43,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:44,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:44,182 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1220320753, now seen corresponding path program 1 times [2022-12-13 15:49:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:44,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519145127] [2022-12-13 15:49:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:49:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:49:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 15:49:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519145127] [2022-12-13 15:49:44,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519145127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678554995] [2022-12-13 15:49:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:44,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:44,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:44,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:44,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 15:49:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:44,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 15:49:44,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:44,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:49:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 15:49:44,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678554995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:49:44,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:49:44,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-12-13 15:49:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100771708] [2022-12-13 15:49:44,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:49:44,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:49:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:49:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:49:44,576 INFO L87 Difference]: Start difference. First operand 1400 states and 1882 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-13 15:49:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:45,574 INFO L93 Difference]: Finished difference Result 3100 states and 4102 transitions. [2022-12-13 15:49:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 15:49:45,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-12-13 15:49:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:45,580 INFO L225 Difference]: With dead ends: 3100 [2022-12-13 15:49:45,580 INFO L226 Difference]: Without dead ends: 2556 [2022-12-13 15:49:45,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 15:49:45,583 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 808 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:45,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1973 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 15:49:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-12-13 15:49:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1789. [2022-12-13 15:49:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1529 states have (on average 1.315892740353172) internal successors, (2012), 1557 states have internal predecessors, (2012), 151 states have call successors, (151), 92 states have call predecessors, (151), 107 states have return successors, (207), 143 states have call predecessors, (207), 148 states have call successors, (207) [2022-12-13 15:49:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2370 transitions. [2022-12-13 15:49:45,702 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2370 transitions. Word has length 69 [2022-12-13 15:49:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:45,703 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2370 transitions. [2022-12-13 15:49:45,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-13 15:49:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2370 transitions. [2022-12-13 15:49:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 15:49:45,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:45,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:45,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 15:49:45,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 15:49:45,907 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1470144615, now seen corresponding path program 1 times [2022-12-13 15:49:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:45,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581244218] [2022-12-13 15:49:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:49:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:49:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 15:49:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581244218] [2022-12-13 15:49:45,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581244218] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020666308] [2022-12-13 15:49:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:45,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:45,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:45,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 15:49:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:49:46,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 15:49:46,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:46,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020666308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:46,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:46,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 15:49:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812979084] [2022-12-13 15:49:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:46,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:46,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:46,097 INFO L87 Difference]: Start difference. First operand 1789 states and 2370 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 15:49:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:46,209 INFO L93 Difference]: Finished difference Result 2512 states and 3308 transitions. [2022-12-13 15:49:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-12-13 15:49:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:46,214 INFO L225 Difference]: With dead ends: 2512 [2022-12-13 15:49:46,214 INFO L226 Difference]: Without dead ends: 1667 [2022-12-13 15:49:46,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:46,216 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 208 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:46,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 354 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-12-13 15:49:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1652. [2022-12-13 15:49:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1408 states have (on average 1.3167613636363635) internal successors, (1854), 1435 states have internal predecessors, (1854), 143 states have call successors, (143), 86 states have call predecessors, (143), 99 states have return successors, (193), 134 states have call predecessors, (193), 140 states have call successors, (193) [2022-12-13 15:49:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2190 transitions. [2022-12-13 15:49:46,321 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2190 transitions. Word has length 88 [2022-12-13 15:49:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:46,321 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 2190 transitions. [2022-12-13 15:49:46,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 15:49:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2190 transitions. [2022-12-13 15:49:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 15:49:46,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:46,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:46,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 15:49:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 15:49:46,524 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1819521257, now seen corresponding path program 1 times [2022-12-13 15:49:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:46,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043133693] [2022-12-13 15:49:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 15:49:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:49:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 15:49:46,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:46,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043133693] [2022-12-13 15:49:46,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043133693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:46,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538365124] [2022-12-13 15:49:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:46,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:46,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:46,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:46,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 15:49:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:46,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:49:46,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 15:49:46,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:46,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538365124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:46,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:46,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:49:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976945018] [2022-12-13 15:49:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:46,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:46,697 INFO L87 Difference]: Start difference. First operand 1652 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:46,846 INFO L93 Difference]: Finished difference Result 2176 states and 2945 transitions. [2022-12-13 15:49:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-12-13 15:49:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:46,857 INFO L225 Difference]: With dead ends: 2176 [2022-12-13 15:49:46,857 INFO L226 Difference]: Without dead ends: 1891 [2022-12-13 15:49:46,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:46,859 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 105 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:46,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 594 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-12-13 15:49:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2022-12-13 15:49:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1599 states have (on average 1.3258286429018136) internal successors, (2120), 1628 states have internal predecessors, (2120), 171 states have call successors, (171), 104 states have call predecessors, (171), 119 states have return successors, (235), 162 states have call predecessors, (235), 168 states have call successors, (235) [2022-12-13 15:49:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2526 transitions. [2022-12-13 15:49:47,068 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2526 transitions. Word has length 93 [2022-12-13 15:49:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:47,068 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2526 transitions. [2022-12-13 15:49:47,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2526 transitions. [2022-12-13 15:49:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-13 15:49:47,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:47,073 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:47,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 15:49:47,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 15:49:47,273 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1756250701, now seen corresponding path program 1 times [2022-12-13 15:49:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:47,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879204566] [2022-12-13 15:49:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:49:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:49:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 15:49:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 15:49:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 15:49:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 15:49:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:47,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879204566] [2022-12-13 15:49:47,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879204566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:47,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019347645] [2022-12-13 15:49:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:47,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:47,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:47,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:47,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 15:49:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:49:47,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 15:49:47,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:47,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019347645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:47,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:47,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 15:49:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316947121] [2022-12-13 15:49:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:47,474 INFO L87 Difference]: Start difference. First operand 1891 states and 2526 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 15:49:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:47,609 INFO L93 Difference]: Finished difference Result 2270 states and 2994 transitions. [2022-12-13 15:49:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:47,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-12-13 15:49:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:47,614 INFO L225 Difference]: With dead ends: 2270 [2022-12-13 15:49:47,614 INFO L226 Difference]: Without dead ends: 944 [2022-12-13 15:49:47,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:47,617 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 62 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:47,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 516 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-12-13 15:49:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2022-12-13 15:49:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 755 states have (on average 1.4066225165562913) internal successors, (1062), 768 states have internal predecessors, (1062), 114 states have call successors, (114), 67 states have call predecessors, (114), 74 states have return successors, (143), 112 states have call predecessors, (143), 112 states have call successors, (143) [2022-12-13 15:49:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1319 transitions. [2022-12-13 15:49:47,684 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1319 transitions. Word has length 103 [2022-12-13 15:49:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:47,685 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1319 transitions. [2022-12-13 15:49:47,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 15:49:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1319 transitions. [2022-12-13 15:49:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 15:49:47,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:47,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:47,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 15:49:47,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 15:49:47,887 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1396789480, now seen corresponding path program 1 times [2022-12-13 15:49:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:47,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575906157] [2022-12-13 15:49:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 15:49:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 15:49:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 15:49:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 15:49:48,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:48,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575906157] [2022-12-13 15:49:48,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575906157] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:48,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446492571] [2022-12-13 15:49:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:48,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:48,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:48,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 15:49:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:49:48,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 15:49:48,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446492571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:48,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:48,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 15:49:48,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125599659] [2022-12-13 15:49:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:48,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:48,149 INFO L87 Difference]: Start difference. First operand 944 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 15:49:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:48,263 INFO L93 Difference]: Finished difference Result 2739 states and 3855 transitions. [2022-12-13 15:49:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-12-13 15:49:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:48,268 INFO L225 Difference]: With dead ends: 2739 [2022-12-13 15:49:48,268 INFO L226 Difference]: Without dead ends: 1806 [2022-12-13 15:49:48,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:48,270 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:48,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-12-13 15:49:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1780. [2022-12-13 15:49:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.4055944055944056) internal successors, (2010), 1454 states have internal predecessors, (2010), 206 states have call successors, (206), 128 states have call predecessors, (206), 143 states have return successors, (257), 201 states have call predecessors, (257), 204 states have call successors, (257) [2022-12-13 15:49:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2473 transitions. [2022-12-13 15:49:48,438 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2473 transitions. Word has length 119 [2022-12-13 15:49:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:48,438 INFO L495 AbstractCegarLoop]: Abstraction has 1780 states and 2473 transitions. [2022-12-13 15:49:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 15:49:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2473 transitions. [2022-12-13 15:49:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 15:49:48,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:48,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:48,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 15:49:48,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:48,644 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -936187258, now seen corresponding path program 1 times [2022-12-13 15:49:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:48,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342089346] [2022-12-13 15:49:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 15:49:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 15:49:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 15:49:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 15:49:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-13 15:49:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:48,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342089346] [2022-12-13 15:49:48,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342089346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230114291] [2022-12-13 15:49:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:48,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:48,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:48,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:48,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 15:49:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:48,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:49:48,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 15:49:49,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:49,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230114291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:49,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:49,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:49:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445604002] [2022-12-13 15:49:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:49,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:49,021 INFO L87 Difference]: Start difference. First operand 1780 states and 2473 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 15:49:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:49,164 INFO L93 Difference]: Finished difference Result 3748 states and 5212 transitions. [2022-12-13 15:49:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2022-12-13 15:49:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:49,169 INFO L225 Difference]: With dead ends: 3748 [2022-12-13 15:49:49,169 INFO L226 Difference]: Without dead ends: 1980 [2022-12-13 15:49:49,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:49,171 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 102 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:49,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2022-12-13 15:49:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1962. [2022-12-13 15:49:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3652392947103276) internal successors, (2168), 1612 states have internal predecessors, (2168), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-12-13 15:49:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2661 transitions. [2022-12-13 15:49:49,283 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2661 transitions. Word has length 135 [2022-12-13 15:49:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:49,283 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2661 transitions. [2022-12-13 15:49:49,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 15:49:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2661 transitions. [2022-12-13 15:49:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 15:49:49,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:49,286 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:49,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:49,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 15:49:49,486 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1173690117, now seen corresponding path program 1 times [2022-12-13 15:49:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:49,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440578359] [2022-12-13 15:49:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 15:49:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 15:49:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:49,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440578359] [2022-12-13 15:49:49,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440578359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:49,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616251327] [2022-12-13 15:49:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:49,593 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:49,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 15:49:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:49,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:49:49,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 15:49:49,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:49,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616251327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:49,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:49,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:49:49,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495769605] [2022-12-13 15:49:49,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:49,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:49,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:49,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:49,707 INFO L87 Difference]: Start difference. First operand 1962 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 15:49:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:49,825 INFO L93 Difference]: Finished difference Result 3023 states and 4170 transitions. [2022-12-13 15:49:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-12-13 15:49:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:49,830 INFO L225 Difference]: With dead ends: 3023 [2022-12-13 15:49:49,831 INFO L226 Difference]: Without dead ends: 1988 [2022-12-13 15:49:49,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:49,833 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:49,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2022-12-13 15:49:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1962. [2022-12-13 15:49:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3406801007556675) internal successors, (2129), 1612 states have internal predecessors, (2129), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-12-13 15:49:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2622 transitions. [2022-12-13 15:49:49,956 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2622 transitions. Word has length 136 [2022-12-13 15:49:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:49,956 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2622 transitions. [2022-12-13 15:49:49,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 15:49:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2622 transitions. [2022-12-13 15:49:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 15:49:49,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:49,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:49,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 15:49:50,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 15:49:50,161 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash -304816677, now seen corresponding path program 1 times [2022-12-13 15:49:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:50,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234722441] [2022-12-13 15:49:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 15:49:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 15:49:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:50,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234722441] [2022-12-13 15:49:50,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234722441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:50,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283008251] [2022-12-13 15:49:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:50,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:50,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:50,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 15:49:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:50,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:49:50,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 15:49:50,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283008251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:50,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:50,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:49:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685008492] [2022-12-13 15:49:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:50,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:50,477 INFO L87 Difference]: Start difference. First operand 1962 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 15:49:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:50,637 INFO L93 Difference]: Finished difference Result 3759 states and 5079 transitions. [2022-12-13 15:49:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2022-12-13 15:49:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:50,646 INFO L225 Difference]: With dead ends: 3759 [2022-12-13 15:49:50,646 INFO L226 Difference]: Without dead ends: 1938 [2022-12-13 15:49:50,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:49:50,649 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:50,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2022-12-13 15:49:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1798. [2022-12-13 15:49:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1455 states have (on average 1.2879725085910654) internal successors, (1874), 1475 states have internal predecessors, (1874), 196 states have call successors, (196), 135 states have call predecessors, (196), 146 states have return successors, (227), 189 states have call predecessors, (227), 194 states have call successors, (227) [2022-12-13 15:49:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2297 transitions. [2022-12-13 15:49:50,764 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2297 transitions. Word has length 136 [2022-12-13 15:49:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:50,764 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2297 transitions. [2022-12-13 15:49:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 15:49:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2297 transitions. [2022-12-13 15:49:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 15:49:50,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:50,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:50,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:50,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:50,969 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -829513402, now seen corresponding path program 1 times [2022-12-13 15:49:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:50,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465978812] [2022-12-13 15:49:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:50,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:49:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 15:49:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:51,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465978812] [2022-12-13 15:49:51,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465978812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:51,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925492433] [2022-12-13 15:49:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:51,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:51,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:51,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:51,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 15:49:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:49:51,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 15:49:51,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:51,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925492433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:51,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:51,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 15:49:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817100922] [2022-12-13 15:49:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:51,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:49:51,250 INFO L87 Difference]: Start difference. First operand 1798 states and 2297 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:51,437 INFO L93 Difference]: Finished difference Result 2932 states and 3786 transitions. [2022-12-13 15:49:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:49:51,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-12-13 15:49:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:51,442 INFO L225 Difference]: With dead ends: 2932 [2022-12-13 15:49:51,442 INFO L226 Difference]: Without dead ends: 1654 [2022-12-13 15:49:51,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:49:51,445 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 149 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:51,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 255 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-12-13 15:49:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1193. [2022-12-13 15:49:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 968 states have (on average 1.2572314049586777) internal successors, (1217), 980 states have internal predecessors, (1217), 131 states have call successors, (131), 88 states have call predecessors, (131), 93 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-12-13 15:49:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1493 transitions. [2022-12-13 15:49:51,537 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1493 transitions. Word has length 137 [2022-12-13 15:49:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:51,537 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1493 transitions. [2022-12-13 15:49:51,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1493 transitions. [2022-12-13 15:49:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 15:49:51,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:51,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:51,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:51,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:51,740 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1598745220, now seen corresponding path program 1 times [2022-12-13 15:49:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:51,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559531781] [2022-12-13 15:49:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:49:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 15:49:51,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:51,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559531781] [2022-12-13 15:49:51,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559531781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:51,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589490508] [2022-12-13 15:49:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:51,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:51,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 15:49:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:51,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:49:51,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 15:49:51,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:51,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589490508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:51,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:51,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 15:49:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520955671] [2022-12-13 15:49:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:51,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:49:51,991 INFO L87 Difference]: Start difference. First operand 1193 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:52,246 INFO L93 Difference]: Finished difference Result 2526 states and 3209 transitions. [2022-12-13 15:49:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:49:52,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-12-13 15:49:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:52,250 INFO L225 Difference]: With dead ends: 2526 [2022-12-13 15:49:52,251 INFO L226 Difference]: Without dead ends: 1343 [2022-12-13 15:49:52,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 15:49:52,254 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 171 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:52,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 249 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-12-13 15:49:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1287. [2022-12-13 15:49:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1056 states have (on average 1.2017045454545454) internal successors, (1269), 1068 states have internal predecessors, (1269), 131 states have call successors, (131), 94 states have call predecessors, (131), 99 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-12-13 15:49:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1545 transitions. [2022-12-13 15:49:52,363 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1545 transitions. Word has length 137 [2022-12-13 15:49:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:52,364 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1545 transitions. [2022-12-13 15:49:52,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1545 transitions. [2022-12-13 15:49:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 15:49:52,365 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:52,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:52,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:52,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:52,566 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash 291602822, now seen corresponding path program 1 times [2022-12-13 15:49:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:52,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561279418] [2022-12-13 15:49:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:49:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 15:49:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:52,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561279418] [2022-12-13 15:49:52,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561279418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:52,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106376006] [2022-12-13 15:49:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:52,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:52,662 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:52,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 15:49:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:52,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:49:52,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 15:49:52,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:52,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106376006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:52,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:52,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 15:49:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220199509] [2022-12-13 15:49:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:52,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:52,771 INFO L87 Difference]: Start difference. First operand 1287 states and 1545 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:52,964 INFO L93 Difference]: Finished difference Result 2430 states and 2939 transitions. [2022-12-13 15:49:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:49:52,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-12-13 15:49:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:52,969 INFO L225 Difference]: With dead ends: 2430 [2022-12-13 15:49:52,969 INFO L226 Difference]: Without dead ends: 1154 [2022-12-13 15:49:52,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:49:52,973 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:52,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-12-13 15:49:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2022-12-13 15:49:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 919 states have (on average 1.1664853101196953) internal successors, (1072), 930 states have internal predecessors, (1072), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-12-13 15:49:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1305 transitions. [2022-12-13 15:49:53,130 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1305 transitions. Word has length 137 [2022-12-13 15:49:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:53,131 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 1305 transitions. [2022-12-13 15:49:53,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1305 transitions. [2022-12-13 15:49:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 15:49:53,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:53,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:53,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 15:49:53,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 15:49:53,334 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1015302262, now seen corresponding path program 1 times [2022-12-13 15:49:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:53,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545367050] [2022-12-13 15:49:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:49:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 15:49:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:53,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545367050] [2022-12-13 15:49:53,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545367050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:49:53,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114039706] [2022-12-13 15:49:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:53,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:49:53,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:49:53,474 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:49:53,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 15:49:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:53,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:49:53,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 15:49:53,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:53,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114039706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:53,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:49:53,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 15:49:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551344743] [2022-12-13 15:49:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:53,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:49:53,572 INFO L87 Difference]: Start difference. First operand 1118 states and 1305 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:53,694 INFO L93 Difference]: Finished difference Result 2253 states and 2674 transitions. [2022-12-13 15:49:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:49:53,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-12-13 15:49:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:53,697 INFO L225 Difference]: With dead ends: 2253 [2022-12-13 15:49:53,697 INFO L226 Difference]: Without dead ends: 1146 [2022-12-13 15:49:53,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:49:53,699 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 10 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:53,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:49:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-12-13 15:49:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1130. [2022-12-13 15:49:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 931 states have (on average 1.1417830290010742) internal successors, (1063), 942 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-12-13 15:49:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1296 transitions. [2022-12-13 15:49:53,820 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1296 transitions. Word has length 137 [2022-12-13 15:49:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:53,820 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1296 transitions. [2022-12-13 15:49:53,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1296 transitions. [2022-12-13 15:49:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 15:49:53,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:53,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:53,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 15:49:54,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 15:49:54,022 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1278353166, now seen corresponding path program 1 times [2022-12-13 15:49:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:54,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449610410] [2022-12-13 15:49:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:49:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-13 15:49:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:54,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449610410] [2022-12-13 15:49:54,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449610410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:54,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:54,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:49:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011279290] [2022-12-13 15:49:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:54,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:49:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:54,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:49:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:49:54,158 INFO L87 Difference]: Start difference. First operand 1130 states and 1296 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 15:49:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:54,708 INFO L93 Difference]: Finished difference Result 2094 states and 2378 transitions. [2022-12-13 15:49:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 15:49:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-12-13 15:49:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:54,712 INFO L225 Difference]: With dead ends: 2094 [2022-12-13 15:49:54,712 INFO L226 Difference]: Without dead ends: 2091 [2022-12-13 15:49:54,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:49:54,713 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 499 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:54,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 476 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:49:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-12-13 15:49:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1506. [2022-12-13 15:49:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1241 states have (on average 1.1402095084609185) internal successors, (1415), 1256 states have internal predecessors, (1415), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-12-13 15:49:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1724 transitions. [2022-12-13 15:49:54,878 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1724 transitions. Word has length 137 [2022-12-13 15:49:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:54,878 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 1724 transitions. [2022-12-13 15:49:54,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 15:49:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1724 transitions. [2022-12-13 15:49:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 15:49:54,879 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:54,879 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:54,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 15:49:54,879 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1645790282, now seen corresponding path program 1 times [2022-12-13 15:49:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:54,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946944333] [2022-12-13 15:49:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:49:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 15:49:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:49:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:49:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:49:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:49:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:49:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:49:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:49:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:49:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 15:49:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:49:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946944333] [2022-12-13 15:49:54,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946944333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:54,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:54,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:49:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484142117] [2022-12-13 15:49:54,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:54,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:49:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:54,937 INFO L87 Difference]: Start difference. First operand 1506 states and 1724 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:49:55,235 INFO L93 Difference]: Finished difference Result 2729 states and 3212 transitions. [2022-12-13 15:49:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:49:55,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-12-13 15:49:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:49:55,239 INFO L225 Difference]: With dead ends: 2729 [2022-12-13 15:49:55,239 INFO L226 Difference]: Without dead ends: 1869 [2022-12-13 15:49:55,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 15:49:55,241 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:49:55,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 445 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:49:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2022-12-13 15:49:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1508. [2022-12-13 15:49:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1243 states have (on average 1.1399839098954143) internal successors, (1417), 1258 states have internal predecessors, (1417), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-12-13 15:49:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1726 transitions. [2022-12-13 15:49:55,383 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1726 transitions. Word has length 141 [2022-12-13 15:49:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:49:55,383 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 1726 transitions. [2022-12-13 15:49:55,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:49:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1726 transitions. [2022-12-13 15:49:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-13 15:49:55,384 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:49:55,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:55,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 15:49:55,384 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:49:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1749276047, now seen corresponding path program 1 times [2022-12-13 15:49:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:49:55,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252674272] [2022-12-13 15:49:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:49:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:49:55,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:49:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:49:55,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:49:55,435 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:49:55,435 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 15:49:55,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 15:49:55,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 15:49:55,439 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:55,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:49:55,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:49:55 BoogieIcfgContainer [2022-12-13 15:49:55,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:49:55,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:49:55,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:49:55,536 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:49:55,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:49:38" (3/4) ... [2022-12-13 15:49:55,537 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 15:49:55,611 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 15:49:55,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:49:55,612 INFO L158 Benchmark]: Toolchain (without parser) took 18203.94ms. Allocated memory was 146.8MB in the beginning and 459.3MB in the end (delta: 312.5MB). Free memory was 112.2MB in the beginning and 240.5MB in the end (delta: -128.3MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,612 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:49:55,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.31ms. Allocated memory is still 146.8MB. Free memory was 111.8MB in the beginning and 96.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.96ms. Allocated memory is still 146.8MB. Free memory was 96.2MB in the beginning and 93.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,612 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 146.8MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,612 INFO L158 Benchmark]: RCFGBuilder took 470.38ms. Allocated memory is still 146.8MB. Free memory was 91.0MB in the beginning and 65.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,613 INFO L158 Benchmark]: TraceAbstraction took 17328.76ms. Allocated memory was 146.8MB in the beginning and 459.3MB in the end (delta: 312.5MB). Free memory was 65.2MB in the beginning and 255.2MB in the end (delta: -190.0MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,613 INFO L158 Benchmark]: Witness Printer took 75.91ms. Allocated memory is still 459.3MB. Free memory was 255.2MB in the beginning and 240.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 15:49:55,614 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.16ms. Allocated memory is still 146.8MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.31ms. Allocated memory is still 146.8MB. Free memory was 111.8MB in the beginning and 96.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.96ms. Allocated memory is still 146.8MB. Free memory was 96.2MB in the beginning and 93.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 146.8MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.38ms. Allocated memory is still 146.8MB. Free memory was 91.0MB in the beginning and 65.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17328.76ms. Allocated memory was 146.8MB in the beginning and 459.3MB in the end (delta: 312.5MB). Free memory was 65.2MB in the beginning and 255.2MB in the end (delta: -190.0MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. * Witness Printer took 75.91ms. Allocated memory is still 459.3MB. Free memory was 255.2MB in the beginning and 240.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L489] token += 1 [L490] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6632 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6434 mSDsluCounter, 13778 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8455 mSDsCounter, 824 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5716 IncrementalHoareTripleChecker+Invalid, 6540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 824 mSolverCounterUnsat, 5323 mSDtfsCounter, 5716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2206 GetRequests, 1996 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1962occurred in iteration=17, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 3176 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3963 NumberOfCodeBlocks, 3963 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3918 ConstructedInterpolants, 0 QuantifiedInterpolants, 6561 SizeOfPredicates, 10 NumberOfNonLiveVariables, 5146 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 1572/1814 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 15:49:55,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b8ba59-4159-4e6d-803e-51919dbad310/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