./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa --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 d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:46:40,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:46:40,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:46:40,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:46:40,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:46:40,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:46:40,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:46:40,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:46:40,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:46:40,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:46:40,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:46:40,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:46:40,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:46:40,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:46:40,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:46:40,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:46:40,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:46:40,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:46:40,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:46:40,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:46:40,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:46:40,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:46:40,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:46:40,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:46:40,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:46:40,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:46:40,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:46:40,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:46:40,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:46:40,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:46:40,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:46:40,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:46:40,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:46:40,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:46:40,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:46:40,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:46:40,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:46:40,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:46:40,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:46:40,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:46:40,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:46:40,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:46:40,658 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:46:40,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:46:40,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:46:40,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:46:40,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:46:40,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:46:40,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:46:40,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:46:40,659 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:46:40,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:46:40,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:46:40,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:46:40,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:46:40,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:46:40,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:46:40,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:46:40,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:46:40,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:46:40,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:46:40,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/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_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa 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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2021-12-06 19:46:40,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:46:40,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:46:40,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:46:40,864 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:46:40,865 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:46:40,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2021-12-06 19:46:40,912 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/data/ce88b86b0/f4909b70f1c14ba78749cc8c06b22074/FLAGd9b5f9ef4 [2021-12-06 19:46:41,301 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:46:41,301 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2021-12-06 19:46:41,311 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/data/ce88b86b0/f4909b70f1c14ba78749cc8c06b22074/FLAGd9b5f9ef4 [2021-12-06 19:46:41,323 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/data/ce88b86b0/f4909b70f1c14ba78749cc8c06b22074 [2021-12-06 19:46:41,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:46:41,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:46:41,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:46:41,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:46:41,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:46:41,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521301a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41, skipping insertion in model container [2021-12-06 19:46:41,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:46:41,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:46:41,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2021-12-06 19:46:41,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2021-12-06 19:46:41,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:46:41,549 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:46:41,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2021-12-06 19:46:41,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2021-12-06 19:46:41,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:46:41,604 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:46:41,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41 WrapperNode [2021-12-06 19:46:41,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:46:41,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:46:41,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:46:41,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:46:41,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,643 INFO L137 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2021-12-06 19:46:41,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:46:41,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:46:41,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:46:41,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:46:41,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:46:41,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:46:41,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:46:41,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:46:41,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (1/1) ... [2021-12-06 19:46:41,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:46:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:46:41,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:46:41,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:46:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:46:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 19:46:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 19:46:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 19:46:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 19:46:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 19:46:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 19:46:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 19:46:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 19:46:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 19:46:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 19:46:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 19:46:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 19:46:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 19:46:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 19:46:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 19:46:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 19:46:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:46:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 19:46:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 19:46:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 19:46:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 19:46:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:46:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:46:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 19:46:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 19:46:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-06 19:46:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-06 19:46:41,797 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:46:41,799 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:46:42,113 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-06 19:46:42,113 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-12-06 19:46:42,152 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:46:42,160 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:46:42,160 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-06 19:46:42,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:46:42 BoogieIcfgContainer [2021-12-06 19:46:42,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:46:42,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:46:42,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:46:42,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:46:42,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:46:41" (1/3) ... [2021-12-06 19:46:42,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108138bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:46:42, skipping insertion in model container [2021-12-06 19:46:42,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:46:41" (2/3) ... [2021-12-06 19:46:42,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108138bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:46:42, skipping insertion in model container [2021-12-06 19:46:42,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:46:42" (3/3) ... [2021-12-06 19:46:42,168 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2021-12-06 19:46:42,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:46:42,172 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 19:46:42,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:46:42,213 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:46:42,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 19:46:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-06 19:46:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:46:42,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:42,241 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:42,241 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2021-12-06 19:46:42,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:42,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973810122] [2021-12-06 19:46:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:42,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:46:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:46:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:46:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:42,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973810122] [2021-12-06 19:46:42,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973810122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:42,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:42,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:46:42,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503699923] [2021-12-06 19:46:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:42,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:46:42,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:46:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:42,516 INFO L87 Difference]: Start difference. First operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:46:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:43,097 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2021-12-06 19:46:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:46:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 19:46:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:43,114 INFO L225 Difference]: With dead ends: 646 [2021-12-06 19:46:43,115 INFO L226 Difference]: Without dead ends: 397 [2021-12-06 19:46:43,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:46:43,122 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 678 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:43,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 1283 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:46:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-06 19:46:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2021-12-06 19:46:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 19:46:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2021-12-06 19:46:43,205 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2021-12-06 19:46:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:43,206 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2021-12-06 19:46:43,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:46:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2021-12-06 19:46:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:46:43,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:43,210 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:43,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:46:43,211 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2021-12-06 19:46:43,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348054343] [2021-12-06 19:46:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:43,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:46:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:46:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:46:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:43,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:43,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348054343] [2021-12-06 19:46:43,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348054343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:43,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:43,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:46:43,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391112959] [2021-12-06 19:46:43,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:43,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:46:43,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:46:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:46:43,347 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-06 19:46:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:44,498 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2021-12-06 19:46:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 19:46:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2021-12-06 19:46:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:44,505 INFO L225 Difference]: With dead ends: 1391 [2021-12-06 19:46:44,505 INFO L226 Difference]: Without dead ends: 1170 [2021-12-06 19:46:44,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 19:46:44,510 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 2123 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:44,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2143 Valid, 2004 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-06 19:46:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2021-12-06 19:46:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2021-12-06 19:46:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2021-12-06 19:46:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2021-12-06 19:46:44,611 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2021-12-06 19:46:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:44,611 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2021-12-06 19:46:44,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-06 19:46:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2021-12-06 19:46:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 19:46:44,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:44,615 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:44,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:46:44,615 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2021-12-06 19:46:44,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:44,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647604799] [2021-12-06 19:46:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:44,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 19:46:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 19:46:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:44,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:44,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647604799] [2021-12-06 19:46:44,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647604799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:44,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:44,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:46:44,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002547639] [2021-12-06 19:46:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:44,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:46:44,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:46:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:46:44,748 INFO L87 Difference]: Start difference. First operand 1031 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 19:46:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:45,177 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2021-12-06 19:46:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:46:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-06 19:46:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:45,183 INFO L225 Difference]: With dead ends: 2057 [2021-12-06 19:46:45,183 INFO L226 Difference]: Without dead ends: 1169 [2021-12-06 19:46:45,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:46:45,187 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 395 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:45,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 1579 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:46:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-06 19:46:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2021-12-06 19:46:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2021-12-06 19:46:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2021-12-06 19:46:45,236 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2021-12-06 19:46:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:45,236 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2021-12-06 19:46:45,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 19:46:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2021-12-06 19:46:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 19:46:45,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:45,238 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:45,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:46:45,238 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2021-12-06 19:46:45,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:45,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699346201] [2021-12-06 19:46:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:45,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 19:46:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 19:46:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:45,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:45,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699346201] [2021-12-06 19:46:45,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699346201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:45,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:45,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:46:45,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288807733] [2021-12-06 19:46:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:45,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:46:45,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:46:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:46:45,326 INFO L87 Difference]: Start difference. First operand 1061 states and 1430 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 19:46:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:46,430 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2021-12-06 19:46:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 19:46:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2021-12-06 19:46:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:46,439 INFO L225 Difference]: With dead ends: 3399 [2021-12-06 19:46:46,439 INFO L226 Difference]: Without dead ends: 1304 [2021-12-06 19:46:46,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 19:46:46,446 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 2189 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:46,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2209 Valid, 2027 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 19:46:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-12-06 19:46:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2021-12-06 19:46:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2021-12-06 19:46:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2021-12-06 19:46:46,515 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2021-12-06 19:46:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:46,516 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2021-12-06 19:46:46,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 19:46:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2021-12-06 19:46:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:46,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:46,518 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:46,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:46:46,518 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:46,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2021-12-06 19:46:46,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:46,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874684228] [2021-12-06 19:46:46,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:46,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:46,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:46,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:46,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:46,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874684228] [2021-12-06 19:46:46,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874684228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:46,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:46,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:46:46,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916107643] [2021-12-06 19:46:46,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:46,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:46:46,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:46:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:46:46,595 INFO L87 Difference]: Start difference. First operand 1149 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-12-06 19:46:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:47,068 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2021-12-06 19:46:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:46:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:47,076 INFO L225 Difference]: With dead ends: 1459 [2021-12-06 19:46:47,077 INFO L226 Difference]: Without dead ends: 1335 [2021-12-06 19:46:47,078 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:46:47,079 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 667 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:47,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 929 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:46:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2021-12-06 19:46:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2021-12-06 19:46:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2021-12-06 19:46:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2021-12-06 19:46:47,145 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2021-12-06 19:46:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:47,145 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2021-12-06 19:46:47,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-12-06 19:46:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2021-12-06 19:46:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:47,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:47,146 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:47,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 19:46:47,147 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2021-12-06 19:46:47,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:47,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096044064] [2021-12-06 19:46:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:47,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:47,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:47,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096044064] [2021-12-06 19:46:47,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096044064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:47,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:47,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:47,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102878387] [2021-12-06 19:46:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:47,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:47,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:47,220 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:47,785 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2021-12-06 19:46:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:46:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:47,792 INFO L225 Difference]: With dead ends: 1732 [2021-12-06 19:46:47,792 INFO L226 Difference]: Without dead ends: 1487 [2021-12-06 19:46:47,793 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:46:47,794 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 684 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:47,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 1134 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:46:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2021-12-06 19:46:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2021-12-06 19:46:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2021-12-06 19:46:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2021-12-06 19:46:47,866 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2021-12-06 19:46:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:47,867 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2021-12-06 19:46:47,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2021-12-06 19:46:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:47,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:47,868 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:47,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 19:46:47,868 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2021-12-06 19:46:47,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:47,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323676427] [2021-12-06 19:46:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:47,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:47,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:47,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323676427] [2021-12-06 19:46:47,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323676427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:47,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:47,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:47,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416470880] [2021-12-06 19:46:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:47,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:47,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:47,938 INFO L87 Difference]: Start difference. First operand 1384 states and 1855 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:48,632 INFO L93 Difference]: Finished difference Result 2206 states and 3083 transitions. [2021-12-06 19:46:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:46:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:48,641 INFO L225 Difference]: With dead ends: 2206 [2021-12-06 19:46:48,641 INFO L226 Difference]: Without dead ends: 1847 [2021-12-06 19:46:48,644 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:46:48,644 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 681 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:48,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 1426 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:46:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2021-12-06 19:46:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1610. [2021-12-06 19:46:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1298 states have (on average 1.386748844375963) internal successors, (1800), 1317 states have internal predecessors, (1800), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2021-12-06 19:46:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2190 transitions. [2021-12-06 19:46:48,738 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2190 transitions. Word has length 69 [2021-12-06 19:46:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:48,739 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2190 transitions. [2021-12-06 19:46:48,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2190 transitions. [2021-12-06 19:46:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:48,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:48,740 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:48,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 19:46:48,740 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2021-12-06 19:46:48,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:48,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998611007] [2021-12-06 19:46:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:48,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:48,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:48,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:48,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998611007] [2021-12-06 19:46:48,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998611007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:48,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:48,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:48,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119172957] [2021-12-06 19:46:48,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:48,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:48,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:48,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:48,794 INFO L87 Difference]: Start difference. First operand 1610 states and 2190 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:49,476 INFO L93 Difference]: Finished difference Result 2996 states and 4250 transitions. [2021-12-06 19:46:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:46:49,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:49,487 INFO L225 Difference]: With dead ends: 2996 [2021-12-06 19:46:49,487 INFO L226 Difference]: Without dead ends: 2411 [2021-12-06 19:46:49,489 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:46:49,489 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 710 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:49,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 1377 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:46:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2021-12-06 19:46:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2017. [2021-12-06 19:46:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1639 states have (on average 1.4020744356314827) internal successors, (2298), 1662 states have internal predecessors, (2298), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2021-12-06 19:46:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2786 transitions. [2021-12-06 19:46:49,583 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2786 transitions. Word has length 69 [2021-12-06 19:46:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:49,583 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2786 transitions. [2021-12-06 19:46:49,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2786 transitions. [2021-12-06 19:46:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:49,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:49,585 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:49,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 19:46:49,585 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2021-12-06 19:46:49,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:49,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064399881] [2021-12-06 19:46:49,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:49,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:49,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:49,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064399881] [2021-12-06 19:46:49,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064399881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:49,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:49,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:49,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260380607] [2021-12-06 19:46:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:49,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:49,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:49,646 INFO L87 Difference]: Start difference. First operand 2017 states and 2786 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:50,077 INFO L93 Difference]: Finished difference Result 3240 states and 4619 transitions. [2021-12-06 19:46:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:46:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:50,087 INFO L225 Difference]: With dead ends: 3240 [2021-12-06 19:46:50,087 INFO L226 Difference]: Without dead ends: 2248 [2021-12-06 19:46:50,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:46:50,091 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 664 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:50,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 749 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:46:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2021-12-06 19:46:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2017. [2021-12-06 19:46:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1639 states have (on average 1.3965832824893227) internal successors, (2289), 1662 states have internal predecessors, (2289), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2021-12-06 19:46:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2777 transitions. [2021-12-06 19:46:50,190 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2777 transitions. Word has length 69 [2021-12-06 19:46:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:50,190 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2777 transitions. [2021-12-06 19:46:50,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2777 transitions. [2021-12-06 19:46:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:50,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:50,192 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:50,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 19:46:50,192 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2021-12-06 19:46:50,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:50,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718552385] [2021-12-06 19:46:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:50,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:50,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:50,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718552385] [2021-12-06 19:46:50,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718552385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:50,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:50,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:50,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391868397] [2021-12-06 19:46:50,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:50,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:50,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:50,257 INFO L87 Difference]: Start difference. First operand 2017 states and 2777 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:50,734 INFO L93 Difference]: Finished difference Result 3552 states and 5054 transitions. [2021-12-06 19:46:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:46:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:50,746 INFO L225 Difference]: With dead ends: 3552 [2021-12-06 19:46:50,746 INFO L226 Difference]: Without dead ends: 2561 [2021-12-06 19:46:50,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:46:50,749 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 376 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:50,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1287 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:46:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2021-12-06 19:46:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2044. [2021-12-06 19:46:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1666 states have (on average 1.39015606242497) internal successors, (2316), 1689 states have internal predecessors, (2316), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2021-12-06 19:46:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2804 transitions. [2021-12-06 19:46:50,843 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2804 transitions. Word has length 69 [2021-12-06 19:46:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:50,843 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 2804 transitions. [2021-12-06 19:46:50,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2804 transitions. [2021-12-06 19:46:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:46:50,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:50,845 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:46:50,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 19:46:50,846 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2021-12-06 19:46:50,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:50,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177227824] [2021-12-06 19:46:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:50,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:46:50,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:50,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177227824] [2021-12-06 19:46:50,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177227824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:50,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:50,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:50,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656265231] [2021-12-06 19:46:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:50,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:50,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:50,921 INFO L87 Difference]: Start difference. First operand 2044 states and 2804 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:51,863 INFO L93 Difference]: Finished difference Result 5508 states and 8002 transitions. [2021-12-06 19:46:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 19:46:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:46:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:51,893 INFO L225 Difference]: With dead ends: 5508 [2021-12-06 19:46:51,893 INFO L226 Difference]: Without dead ends: 4490 [2021-12-06 19:46:51,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-06 19:46:51,899 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 1309 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:51,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1330 Valid, 1239 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 19:46:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2021-12-06 19:46:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3921. [2021-12-06 19:46:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3231 states have (on average 1.4051377282575055) internal successors, (4540), 3285 states have internal predecessors, (4540), 402 states have call successors, (402), 249 states have call predecessors, (402), 286 states have return successors, (569), 395 states have call predecessors, (569), 398 states have call successors, (569) [2021-12-06 19:46:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 5511 transitions. [2021-12-06 19:46:52,094 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 5511 transitions. Word has length 69 [2021-12-06 19:46:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:52,095 INFO L470 AbstractCegarLoop]: Abstraction has 3921 states and 5511 transitions. [2021-12-06 19:46:52,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:46:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 5511 transitions. [2021-12-06 19:46:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 19:46:52,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:52,098 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-12-06 19:46:52,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 19:46:52,099 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash -411543486, now seen corresponding path program 1 times [2021-12-06 19:46:52,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:52,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170272549] [2021-12-06 19:46:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:52,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:46:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:46:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 19:46:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:46:52,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:52,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170272549] [2021-12-06 19:46:52,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170272549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:52,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:52,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:46:52,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177334691] [2021-12-06 19:46:52,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:52,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:46:52,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:46:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:46:52,188 INFO L87 Difference]: Start difference. First operand 3921 states and 5511 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 19:46:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:52,678 INFO L93 Difference]: Finished difference Result 5098 states and 7062 transitions. [2021-12-06 19:46:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 19:46:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2021-12-06 19:46:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:52,701 INFO L225 Difference]: With dead ends: 5098 [2021-12-06 19:46:52,701 INFO L226 Difference]: Without dead ends: 4092 [2021-12-06 19:46:52,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:46:52,706 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 258 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:52,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1677 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:46:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2021-12-06 19:46:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3961. [2021-12-06 19:46:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3263 states have (on average 1.4002451731535397) internal successors, (4569), 3317 states have internal predecessors, (4569), 402 states have call successors, (402), 249 states have call predecessors, (402), 294 states have return successors, (577), 403 states have call predecessors, (577), 398 states have call successors, (577) [2021-12-06 19:46:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5548 transitions. [2021-12-06 19:46:52,921 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5548 transitions. Word has length 91 [2021-12-06 19:46:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:52,922 INFO L470 AbstractCegarLoop]: Abstraction has 3961 states and 5548 transitions. [2021-12-06 19:46:52,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 19:46:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5548 transitions. [2021-12-06 19:46:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 19:46:52,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:52,925 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-12-06 19:46:52,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 19:46:52,925 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash 32357188, now seen corresponding path program 1 times [2021-12-06 19:46:52,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:52,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077244826] [2021-12-06 19:46:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:52,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:46:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:46:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 19:46:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:46:52,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077244826] [2021-12-06 19:46:52,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077244826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:52,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:52,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:46:52,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127453125] [2021-12-06 19:46:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:52,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:46:52,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:46:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:53,000 INFO L87 Difference]: Start difference. First operand 3961 states and 5548 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:46:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:53,608 INFO L93 Difference]: Finished difference Result 5999 states and 8153 transitions. [2021-12-06 19:46:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 19:46:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2021-12-06 19:46:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:53,627 INFO L225 Difference]: With dead ends: 5999 [2021-12-06 19:46:53,627 INFO L226 Difference]: Without dead ends: 4954 [2021-12-06 19:46:53,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-12-06 19:46:53,630 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 688 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:53,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 1336 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:46:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2021-12-06 19:46:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4638. [2021-12-06 19:46:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 3792 states have (on average 1.3800105485232068) internal successors, (5233), 3859 states have internal predecessors, (5233), 478 states have call successors, (478), 302 states have call predecessors, (478), 366 states have return successors, (690), 486 states have call predecessors, (690), 474 states have call successors, (690) [2021-12-06 19:46:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6401 transitions. [2021-12-06 19:46:53,842 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6401 transitions. Word has length 91 [2021-12-06 19:46:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:53,842 INFO L470 AbstractCegarLoop]: Abstraction has 4638 states and 6401 transitions. [2021-12-06 19:46:53,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:46:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6401 transitions. [2021-12-06 19:46:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 19:46:53,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:53,846 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-12-06 19:46:53,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 19:46:53,846 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1971519234, now seen corresponding path program 1 times [2021-12-06 19:46:53,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:53,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692928509] [2021-12-06 19:46:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:53,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:46:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:46:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 19:46:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 19:46:53,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:53,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692928509] [2021-12-06 19:46:53,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692928509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:53,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:53,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:46:53,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273184161] [2021-12-06 19:46:53,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:53,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:46:53,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:53,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:46:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:46:53,905 INFO L87 Difference]: Start difference. First operand 4638 states and 6401 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 19:46:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:54,420 INFO L93 Difference]: Finished difference Result 8297 states and 11183 transitions. [2021-12-06 19:46:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 19:46:54,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2021-12-06 19:46:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:54,446 INFO L225 Difference]: With dead ends: 8297 [2021-12-06 19:46:54,446 INFO L226 Difference]: Without dead ends: 6577 [2021-12-06 19:46:54,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-06 19:46:54,450 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 910 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:54,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 729 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:46:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2021-12-06 19:46:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6357. [2021-12-06 19:46:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6357 states, 5130 states have (on average 1.3442495126705654) internal successors, (6896), 5233 states have internal predecessors, (6896), 671 states have call successors, (671), 436 states have call predecessors, (671), 554 states have return successors, (1030), 699 states have call predecessors, (1030), 667 states have call successors, (1030) [2021-12-06 19:46:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6357 states to 6357 states and 8597 transitions. [2021-12-06 19:46:54,754 INFO L78 Accepts]: Start accepts. Automaton has 6357 states and 8597 transitions. Word has length 91 [2021-12-06 19:46:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:54,754 INFO L470 AbstractCegarLoop]: Abstraction has 6357 states and 8597 transitions. [2021-12-06 19:46:54,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 19:46:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6357 states and 8597 transitions. [2021-12-06 19:46:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 19:46:54,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:54,759 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-12-06 19:46:54,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 19:46:54,759 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 913681156, now seen corresponding path program 1 times [2021-12-06 19:46:54,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336885820] [2021-12-06 19:46:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:54,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:46:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:46:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 19:46:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:46:54,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:54,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336885820] [2021-12-06 19:46:54,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336885820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:54,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:54,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:46:54,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761068073] [2021-12-06 19:46:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:54,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:46:54,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:46:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:46:54,808 INFO L87 Difference]: Start difference. First operand 6357 states and 8597 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:46:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:55,220 INFO L93 Difference]: Finished difference Result 8195 states and 10900 transitions. [2021-12-06 19:46:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:46:55,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2021-12-06 19:46:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:55,232 INFO L225 Difference]: With dead ends: 8195 [2021-12-06 19:46:55,232 INFO L226 Difference]: Without dead ends: 4756 [2021-12-06 19:46:55,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:46:55,238 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 376 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:55,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 903 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:46:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2021-12-06 19:46:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 4638. [2021-12-06 19:46:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 3792 states have (on average 1.3686708860759493) internal successors, (5190), 3859 states have internal predecessors, (5190), 478 states have call successors, (478), 302 states have call predecessors, (478), 366 states have return successors, (690), 486 states have call predecessors, (690), 474 states have call successors, (690) [2021-12-06 19:46:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6358 transitions. [2021-12-06 19:46:55,516 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6358 transitions. Word has length 91 [2021-12-06 19:46:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:55,517 INFO L470 AbstractCegarLoop]: Abstraction has 4638 states and 6358 transitions. [2021-12-06 19:46:55,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:46:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6358 transitions. [2021-12-06 19:46:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-06 19:46:55,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:55,520 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2021-12-06 19:46:55,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 19:46:55,520 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1870290611, now seen corresponding path program 1 times [2021-12-06 19:46:55,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:55,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870653020] [2021-12-06 19:46:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:55,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:46:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:46:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:46:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:46:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:46:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 19:46:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:46:55,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:55,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870653020] [2021-12-06 19:46:55,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870653020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:55,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:46:55,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:46:55,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050368374] [2021-12-06 19:46:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:55,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:46:55,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:46:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:46:55,585 INFO L87 Difference]: Start difference. First operand 4638 states and 6358 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:46:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:56,470 INFO L93 Difference]: Finished difference Result 7464 states and 9960 transitions. [2021-12-06 19:46:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 19:46:56,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2021-12-06 19:46:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:56,481 INFO L225 Difference]: With dead ends: 7464 [2021-12-06 19:46:56,482 INFO L226 Difference]: Without dead ends: 5437 [2021-12-06 19:46:56,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-06 19:46:56,486 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1545 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:46:56,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1578 Valid, 1372 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:46:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2021-12-06 19:46:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 5260. [2021-12-06 19:46:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 4258 states have (on average 1.3435885392202913) internal successors, (5721), 4333 states have internal predecessors, (5721), 556 states have call successors, (556), 350 states have call predecessors, (556), 444 states have return successors, (823), 586 states have call predecessors, (823), 552 states have call successors, (823) [2021-12-06 19:46:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 7100 transitions. [2021-12-06 19:46:56,773 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 7100 transitions. Word has length 92 [2021-12-06 19:46:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:56,773 INFO L470 AbstractCegarLoop]: Abstraction has 5260 states and 7100 transitions. [2021-12-06 19:46:56,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:46:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 7100 transitions. [2021-12-06 19:46:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-06 19:46:56,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:56,777 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-06 19:46:56,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 19:46:56,778 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 56705439, now seen corresponding path program 1 times [2021-12-06 19:46:56,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:56,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400572762] [2021-12-06 19:46:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:56,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:46:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:46:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 19:46:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 19:46:56,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:56,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400572762] [2021-12-06 19:46:56,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400572762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:46:56,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196701484] [2021-12-06 19:46:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:56,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:46:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:46:56,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:46:56,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:46:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:56,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:46:56,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:46:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:46:57,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:46:57,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196701484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:57,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:46:57,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:46:57,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566006625] [2021-12-06 19:46:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:57,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:46:57,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:46:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:57,029 INFO L87 Difference]: Start difference. First operand 5260 states and 7100 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2021-12-06 19:46:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:57,482 INFO L93 Difference]: Finished difference Result 10874 states and 15268 transitions. [2021-12-06 19:46:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:46:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 111 [2021-12-06 19:46:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:57,498 INFO L225 Difference]: With dead ends: 10874 [2021-12-06 19:46:57,498 INFO L226 Difference]: Without dead ends: 5785 [2021-12-06 19:46:57,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:57,511 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 829 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 [2021-12-06 19:46:57,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 829 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:46:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2021-12-06 19:46:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5785. [2021-12-06 19:46:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 4700 states have (on average 1.3495744680851063) internal successors, (6343), 4779 states have internal predecessors, (6343), 605 states have call successors, (605), 380 states have call predecessors, (605), 478 states have return successors, (901), 635 states have call predecessors, (901), 601 states have call successors, (901) [2021-12-06 19:46:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 7849 transitions. [2021-12-06 19:46:57,799 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 7849 transitions. Word has length 111 [2021-12-06 19:46:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:57,799 INFO L470 AbstractCegarLoop]: Abstraction has 5785 states and 7849 transitions. [2021-12-06 19:46:57,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2021-12-06 19:46:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 7849 transitions. [2021-12-06 19:46:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-06 19:46:57,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:57,806 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1] [2021-12-06 19:46:57,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:46:58,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 19:46:58,007 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1296496829, now seen corresponding path program 1 times [2021-12-06 19:46:58,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:58,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927857979] [2021-12-06 19:46:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:58,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:46:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:46:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 19:46:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:46:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 19:46:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:46:58,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:58,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927857979] [2021-12-06 19:46:58,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927857979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:46:58,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102664453] [2021-12-06 19:46:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:58,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:46:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:46:58,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:46:58,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:46:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:58,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:46:58,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:46:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:46:58,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:46:58,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102664453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:58,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:46:58,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 19:46:58,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215730124] [2021-12-06 19:46:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:58,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:46:58,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:46:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:58,334 INFO L87 Difference]: Start difference. First operand 5785 states and 7849 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:46:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:46:58,700 INFO L93 Difference]: Finished difference Result 12495 states and 17694 transitions. [2021-12-06 19:46:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:46:58,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2021-12-06 19:46:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:46:58,722 INFO L225 Difference]: With dead ends: 12495 [2021-12-06 19:46:58,723 INFO L226 Difference]: Without dead ends: 9075 [2021-12-06 19:46:58,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:58,733 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 517 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 [2021-12-06 19:46:58,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 517 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:46:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2021-12-06 19:46:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 9005. [2021-12-06 19:46:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9005 states, 7394 states have (on average 1.3755747903705708) internal successors, (10171), 7516 states have internal predecessors, (10171), 909 states have call successors, (909), 574 states have call predecessors, (909), 700 states have return successors, (1365), 924 states have call predecessors, (1365), 905 states have call successors, (1365) [2021-12-06 19:46:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 12445 transitions. [2021-12-06 19:46:59,159 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 12445 transitions. Word has length 143 [2021-12-06 19:46:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:46:59,159 INFO L470 AbstractCegarLoop]: Abstraction has 9005 states and 12445 transitions. [2021-12-06 19:46:59,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:46:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 12445 transitions. [2021-12-06 19:46:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-06 19:46:59,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:46:59,169 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1] [2021-12-06 19:46:59,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:46:59,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:46:59,371 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:46:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2080420097, now seen corresponding path program 1 times [2021-12-06 19:46:59,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766009230] [2021-12-06 19:46:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:59,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:46:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:46:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:46:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:46:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:46:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:46:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:46:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 19:46:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:46:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 19:46:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:46:59,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:59,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766009230] [2021-12-06 19:46:59,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766009230] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:46:59,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212161922] [2021-12-06 19:46:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:59,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:46:59,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:46:59,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:46:59,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:46:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:59,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:46:59,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:46:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:46:59,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:46:59,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212161922] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:46:59,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:46:59,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 19:46:59,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070337064] [2021-12-06 19:46:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:46:59,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:46:59,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:59,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:46:59,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:46:59,703 INFO L87 Difference]: Start difference. First operand 9005 states and 12445 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:47:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:00,247 INFO L93 Difference]: Finished difference Result 16265 states and 23071 transitions. [2021-12-06 19:47:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:00,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2021-12-06 19:47:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:00,272 INFO L225 Difference]: With dead ends: 16265 [2021-12-06 19:47:00,272 INFO L226 Difference]: Without dead ends: 12077 [2021-12-06 19:47:00,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:00,284 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 253 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 538 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 [2021-12-06 19:47:00,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12077 states. [2021-12-06 19:47:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12077 to 11977. [2021-12-06 19:47:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11977 states, 9901 states have (on average 1.3896576103423897) internal successors, (13759), 10057 states have internal predecessors, (13759), 1177 states have call successors, (1177), 747 states have call predecessors, (1177), 897 states have return successors, (1746), 1182 states have call predecessors, (1746), 1173 states have call successors, (1746) [2021-12-06 19:47:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11977 states to 11977 states and 16682 transitions. [2021-12-06 19:47:00,830 INFO L78 Accepts]: Start accepts. Automaton has 11977 states and 16682 transitions. Word has length 143 [2021-12-06 19:47:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:00,830 INFO L470 AbstractCegarLoop]: Abstraction has 11977 states and 16682 transitions. [2021-12-06 19:47:00,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:47:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 11977 states and 16682 transitions. [2021-12-06 19:47:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:47:00,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:00,842 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:00,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 19:47:01,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:01,044 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1194272178, now seen corresponding path program 1 times [2021-12-06 19:47:01,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:01,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229138416] [2021-12-06 19:47:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:01,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:47:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:47:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:47:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:47:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 19:47:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 19:47:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 19:47:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:47:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 19:47:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 19:47:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-06 19:47:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 19:47:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 19:47:01,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:01,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229138416] [2021-12-06 19:47:01,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229138416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:01,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073375838] [2021-12-06 19:47:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:01,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:01,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:01,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:01,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:47:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:01,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:01,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 19:47:01,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:01,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073375838] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:01,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:01,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 19:47:01,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707234725] [2021-12-06 19:47:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:01,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:01,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:01,373 INFO L87 Difference]: Start difference. First operand 11977 states and 16682 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 19:47:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:01,911 INFO L93 Difference]: Finished difference Result 16302 states and 21997 transitions. [2021-12-06 19:47:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2021-12-06 19:47:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:01,940 INFO L225 Difference]: With dead ends: 16302 [2021-12-06 19:47:01,940 INFO L226 Difference]: Without dead ends: 14114 [2021-12-06 19:47:01,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:01,948 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 61 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:01,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 671 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2021-12-06 19:47:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 14069. [2021-12-06 19:47:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14069 states, 11526 states have (on average 1.3627450980392157) internal successors, (15707), 11711 states have internal predecessors, (15707), 1411 states have call successors, (1411), 929 states have call predecessors, (1411), 1130 states have return successors, (2053), 1438 states have call predecessors, (2053), 1407 states have call successors, (2053) [2021-12-06 19:47:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14069 states to 14069 states and 19171 transitions. [2021-12-06 19:47:02,599 INFO L78 Accepts]: Start accepts. Automaton has 14069 states and 19171 transitions. Word has length 163 [2021-12-06 19:47:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:02,600 INFO L470 AbstractCegarLoop]: Abstraction has 14069 states and 19171 transitions. [2021-12-06 19:47:02,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 19:47:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 14069 states and 19171 transitions. [2021-12-06 19:47:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:47:02,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:02,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 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] [2021-12-06 19:47:02,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:47:02,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:02,814 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 746982758, now seen corresponding path program 1 times [2021-12-06 19:47:02,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212369447] [2021-12-06 19:47:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:02,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:47:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:47:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 19:47:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:47:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-06 19:47:02,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:02,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212369447] [2021-12-06 19:47:02,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212369447] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:02,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398680701] [2021-12-06 19:47:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:02,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:02,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:02,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:47:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:02,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:02,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:47:03,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:03,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398680701] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:03,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:03,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:03,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756734055] [2021-12-06 19:47:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:03,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:03,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:03,135 INFO L87 Difference]: Start difference. First operand 14069 states and 19171 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:47:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:03,745 INFO L93 Difference]: Finished difference Result 19704 states and 27234 transitions. [2021-12-06 19:47:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-06 19:47:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:03,767 INFO L225 Difference]: With dead ends: 19704 [2021-12-06 19:47:03,767 INFO L226 Difference]: Without dead ends: 11177 [2021-12-06 19:47:03,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:03,783 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 271 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:03,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2021-12-06 19:47:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 10697. [2021-12-06 19:47:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10697 states, 8719 states have (on average 1.3027870168597315) internal successors, (11359), 8838 states have internal predecessors, (11359), 1072 states have call successors, (1072), 745 states have call predecessors, (1072), 904 states have return successors, (1423), 1119 states have call predecessors, (1423), 1068 states have call successors, (1423) [2021-12-06 19:47:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10697 states to 10697 states and 13854 transitions. [2021-12-06 19:47:04,328 INFO L78 Accepts]: Start accepts. Automaton has 10697 states and 13854 transitions. Word has length 160 [2021-12-06 19:47:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:04,329 INFO L470 AbstractCegarLoop]: Abstraction has 10697 states and 13854 transitions. [2021-12-06 19:47:04,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:47:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10697 states and 13854 transitions. [2021-12-06 19:47:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:47:04,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:04,336 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2021-12-06 19:47:04,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:47:04,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:04,538 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1605594576, now seen corresponding path program 1 times [2021-12-06 19:47:04,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:04,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320644213] [2021-12-06 19:47:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:04,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:47:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:47:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:47:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:47:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-06 19:47:04,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320644213] [2021-12-06 19:47:04,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320644213] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635644636] [2021-12-06 19:47:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:04,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:04,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:04,653 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:04,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:47:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:04,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:47:04,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-06 19:47:04,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:04,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635644636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:04,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:04,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:04,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520258894] [2021-12-06 19:47:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:04,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:04,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:04,830 INFO L87 Difference]: Start difference. First operand 10697 states and 13854 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:47:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:05,368 INFO L93 Difference]: Finished difference Result 17534 states and 23048 transitions. [2021-12-06 19:47:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 160 [2021-12-06 19:47:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:05,387 INFO L225 Difference]: With dead ends: 17534 [2021-12-06 19:47:05,388 INFO L226 Difference]: Without dead ends: 11295 [2021-12-06 19:47:05,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:05,396 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 298 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:05,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 525 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11295 states. [2021-12-06 19:47:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11295 to 11150. [2021-12-06 19:47:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11150 states, 9135 states have (on average 1.2825396825396826) internal successors, (11716), 9249 states have internal predecessors, (11716), 1074 states have call successors, (1074), 777 states have call predecessors, (1074), 939 states have return successors, (1419), 1129 states have call predecessors, (1419), 1070 states have call successors, (1419) [2021-12-06 19:47:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 14209 transitions. [2021-12-06 19:47:05,983 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 14209 transitions. Word has length 160 [2021-12-06 19:47:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:05,983 INFO L470 AbstractCegarLoop]: Abstraction has 11150 states and 14209 transitions. [2021-12-06 19:47:05,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:47:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 14209 transitions. [2021-12-06 19:47:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:47:05,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:05,991 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 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] [2021-12-06 19:47:06,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:47:06,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 19:47:06,193 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:06,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 522982663, now seen corresponding path program 1 times [2021-12-06 19:47:06,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:06,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403576919] [2021-12-06 19:47:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:06,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:47:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:47:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:47:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:47:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-06 19:47:06,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:06,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403576919] [2021-12-06 19:47:06,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403576919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451666879] [2021-12-06 19:47:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:06,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:06,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:06,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:47:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:06,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:06,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:47:06,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:06,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451666879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:06,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:06,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:06,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62239127] [2021-12-06 19:47:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:06,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:06,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:06,464 INFO L87 Difference]: Start difference. First operand 11150 states and 14209 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2021-12-06 19:47:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:07,340 INFO L93 Difference]: Finished difference Result 23451 states and 30632 transitions. [2021-12-06 19:47:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:07,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 161 [2021-12-06 19:47:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:07,373 INFO L225 Difference]: With dead ends: 23451 [2021-12-06 19:47:07,373 INFO L226 Difference]: Without dead ends: 16759 [2021-12-06 19:47:07,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:07,383 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 151 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:07,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 818 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16759 states. [2021-12-06 19:47:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16759 to 16755. [2021-12-06 19:47:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16755 states, 13837 states have (on average 1.2924044229240443) internal successors, (17883), 14001 states have internal predecessors, (17883), 1581 states have call successors, (1581), 1132 states have call predecessors, (1581), 1335 states have return successors, (2254), 1631 states have call predecessors, (2254), 1577 states have call successors, (2254) [2021-12-06 19:47:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 21718 transitions. [2021-12-06 19:47:08,261 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 21718 transitions. Word has length 161 [2021-12-06 19:47:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:08,262 INFO L470 AbstractCegarLoop]: Abstraction has 16755 states and 21718 transitions. [2021-12-06 19:47:08,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2021-12-06 19:47:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 21718 transitions. [2021-12-06 19:47:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:47:08,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:08,273 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:47:08,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:47:08,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:08,475 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 675676757, now seen corresponding path program 1 times [2021-12-06 19:47:08,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:08,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056622461] [2021-12-06 19:47:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:08,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:47:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:47:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:47:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:47:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-06 19:47:08,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:08,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056622461] [2021-12-06 19:47:08,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056622461] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:08,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210795110] [2021-12-06 19:47:08,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:08,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:08,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:08,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:47:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:08,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:47:08,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-06 19:47:08,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:08,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210795110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:08,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:08,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:08,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691657774] [2021-12-06 19:47:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:08,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:08,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:08,759 INFO L87 Difference]: Start difference. First operand 16755 states and 21718 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, (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) [2021-12-06 19:47:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:10,132 INFO L93 Difference]: Finished difference Result 40810 states and 54220 transitions. [2021-12-06 19:47:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:10,133 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, (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 161 [2021-12-06 19:47:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:10,188 INFO L225 Difference]: With dead ends: 40810 [2021-12-06 19:47:10,188 INFO L226 Difference]: Without dead ends: 28517 [2021-12-06 19:47:10,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:10,205 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 297 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:10,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 551 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28517 states. [2021-12-06 19:47:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28517 to 28251. [2021-12-06 19:47:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28251 states, 23571 states have (on average 1.2945992957447712) internal successors, (30515), 23835 states have internal predecessors, (30515), 2551 states have call successors, (2551), 1848 states have call predecessors, (2551), 2127 states have return successors, (4331), 2585 states have call predecessors, (4331), 2547 states have call successors, (4331) [2021-12-06 19:47:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28251 states to 28251 states and 37397 transitions. [2021-12-06 19:47:11,835 INFO L78 Accepts]: Start accepts. Automaton has 28251 states and 37397 transitions. Word has length 161 [2021-12-06 19:47:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:11,835 INFO L470 AbstractCegarLoop]: Abstraction has 28251 states and 37397 transitions. [2021-12-06 19:47:11,835 INFO L471 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, (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) [2021-12-06 19:47:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28251 states and 37397 transitions. [2021-12-06 19:47:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:47:11,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:11,852 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2021-12-06 19:47:11,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 19:47:12,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:12,054 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1567842387, now seen corresponding path program 1 times [2021-12-06 19:47:12,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:12,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983517928] [2021-12-06 19:47:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:12,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:47:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:47:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:47:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:47:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 19:47:12,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:12,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983517928] [2021-12-06 19:47:12,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983517928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:12,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:12,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:47:12,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305458909] [2021-12-06 19:47:12,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:12,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:12,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:47:12,113 INFO L87 Difference]: Start difference. First operand 28251 states and 37397 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:47:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:13,712 INFO L93 Difference]: Finished difference Result 49844 states and 66334 transitions. [2021-12-06 19:47:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:47:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-06 19:47:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:13,765 INFO L225 Difference]: With dead ends: 49844 [2021-12-06 19:47:13,765 INFO L226 Difference]: Without dead ends: 26053 [2021-12-06 19:47:13,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:47:13,788 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 431 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:13,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 683 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:47:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26053 states. [2021-12-06 19:47:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26053 to 24059. [2021-12-06 19:47:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24059 states, 19989 states have (on average 1.293211266196408) internal successors, (25850), 20382 states have internal predecessors, (25850), 2061 states have call successors, (2061), 1488 states have call predecessors, (2061), 2007 states have return successors, (3780), 2198 states have call predecessors, (3780), 2057 states have call successors, (3780) [2021-12-06 19:47:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24059 states to 24059 states and 31691 transitions. [2021-12-06 19:47:15,169 INFO L78 Accepts]: Start accepts. Automaton has 24059 states and 31691 transitions. Word has length 161 [2021-12-06 19:47:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:15,169 INFO L470 AbstractCegarLoop]: Abstraction has 24059 states and 31691 transitions. [2021-12-06 19:47:15,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:47:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 24059 states and 31691 transitions. [2021-12-06 19:47:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:47:15,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:15,181 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:47:15,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 19:47:15,181 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -423691555, now seen corresponding path program 1 times [2021-12-06 19:47:15,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:15,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944631272] [2021-12-06 19:47:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:15,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:47:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 19:47:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:47:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:47:15,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:15,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944631272] [2021-12-06 19:47:15,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944631272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:15,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561446326] [2021-12-06 19:47:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:15,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:15,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:15,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:15,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:47:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:15,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:47:15,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:47:15,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:15,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561446326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:15,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:15,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:15,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583660924] [2021-12-06 19:47:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:15,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:15,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:15,433 INFO L87 Difference]: Start difference. First operand 24059 states and 31691 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2021-12-06 19:47:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:16,898 INFO L93 Difference]: Finished difference Result 37494 states and 51321 transitions. [2021-12-06 19:47:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:16,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 163 [2021-12-06 19:47:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:16,949 INFO L225 Difference]: With dead ends: 37494 [2021-12-06 19:47:16,949 INFO L226 Difference]: Without dead ends: 24089 [2021-12-06 19:47:16,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:16,975 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 140 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 752 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 [2021-12-06 19:47:16,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 752 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24089 states. [2021-12-06 19:47:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24089 to 24035. [2021-12-06 19:47:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24035 states, 19965 states have (on average 1.2731780616078137) internal successors, (25419), 20358 states have internal predecessors, (25419), 2061 states have call successors, (2061), 1488 states have call predecessors, (2061), 2007 states have return successors, (3780), 2198 states have call predecessors, (3780), 2057 states have call successors, (3780) [2021-12-06 19:47:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 31260 transitions. [2021-12-06 19:47:18,361 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 31260 transitions. Word has length 163 [2021-12-06 19:47:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:18,362 INFO L470 AbstractCegarLoop]: Abstraction has 24035 states and 31260 transitions. [2021-12-06 19:47:18,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2021-12-06 19:47:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 31260 transitions. [2021-12-06 19:47:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:47:18,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:18,373 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 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] [2021-12-06 19:47:18,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:47:18,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 19:47:18,575 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:18,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1271742787, now seen corresponding path program 1 times [2021-12-06 19:47:18,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:18,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631640608] [2021-12-06 19:47:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:18,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:47:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 19:47:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:47:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:47:18,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:18,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631640608] [2021-12-06 19:47:18,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631640608] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:18,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201611693] [2021-12-06 19:47:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:18,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:18,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:18,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:18,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:47:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:18,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:18,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:47:18,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:18,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201611693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:18,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:18,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:18,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049185074] [2021-12-06 19:47:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:18,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:18,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:18,841 INFO L87 Difference]: Start difference. First operand 24035 states and 31260 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:47:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:20,249 INFO L93 Difference]: Finished difference Result 45362 states and 60517 transitions. [2021-12-06 19:47:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2021-12-06 19:47:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:20,303 INFO L225 Difference]: With dead ends: 45362 [2021-12-06 19:47:20,303 INFO L226 Difference]: Without dead ends: 25789 [2021-12-06 19:47:20,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:20,333 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 285 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 365 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 [2021-12-06 19:47:20,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 365 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25789 states. [2021-12-06 19:47:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25789 to 25491. [2021-12-06 19:47:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25491 states, 21337 states have (on average 1.239349486806955) internal successors, (26444), 21764 states have internal predecessors, (26444), 2061 states have call successors, (2061), 1538 states have call predecessors, (2061), 2091 states have return successors, (3687), 2198 states have call predecessors, (3687), 2057 states have call successors, (3687) [2021-12-06 19:47:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25491 states to 25491 states and 32192 transitions. [2021-12-06 19:47:21,858 INFO L78 Accepts]: Start accepts. Automaton has 25491 states and 32192 transitions. Word has length 163 [2021-12-06 19:47:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:21,858 INFO L470 AbstractCegarLoop]: Abstraction has 25491 states and 32192 transitions. [2021-12-06 19:47:21,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:47:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 25491 states and 32192 transitions. [2021-12-06 19:47:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:47:21,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:21,871 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2021-12-06 19:47:21,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 19:47:22,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:22,073 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1192837573, now seen corresponding path program 1 times [2021-12-06 19:47:22,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:22,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061445320] [2021-12-06 19:47:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:22,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:47:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:47:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:47:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:47:22,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:22,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061445320] [2021-12-06 19:47:22,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061445320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:22,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518586235] [2021-12-06 19:47:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:22,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:22,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:22,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:47:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:22,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:47:22,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 19:47:22,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:22,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518586235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:22,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:22,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 19:47:22,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593476361] [2021-12-06 19:47:22,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:22,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:22,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:47:22,397 INFO L87 Difference]: Start difference. First operand 25491 states and 32192 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:47:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:24,198 INFO L93 Difference]: Finished difference Result 43914 states and 56841 transitions. [2021-12-06 19:47:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:47:24,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2021-12-06 19:47:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:24,248 INFO L225 Difference]: With dead ends: 43914 [2021-12-06 19:47:24,248 INFO L226 Difference]: Without dead ends: 23955 [2021-12-06 19:47:24,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:47:24,277 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 408 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:24,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 632 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:47:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23955 states. [2021-12-06 19:47:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23955 to 21620. [2021-12-06 19:47:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21620 states, 18066 states have (on average 1.2082918188863057) internal successors, (21829), 18420 states have internal predecessors, (21829), 1761 states have call successors, (1761), 1318 states have call predecessors, (1761), 1791 states have return successors, (3025), 1887 states have call predecessors, (3025), 1757 states have call successors, (3025) [2021-12-06 19:47:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 26615 transitions. [2021-12-06 19:47:25,671 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 26615 transitions. Word has length 165 [2021-12-06 19:47:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:25,672 INFO L470 AbstractCegarLoop]: Abstraction has 21620 states and 26615 transitions. [2021-12-06 19:47:25,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:47:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 26615 transitions. [2021-12-06 19:47:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:47:25,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:25,681 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2021-12-06 19:47:25,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 19:47:25,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 19:47:25,883 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -649638141, now seen corresponding path program 1 times [2021-12-06 19:47:25,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:25,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553576801] [2021-12-06 19:47:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:25,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:47:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:47:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:47:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:47:25,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553576801] [2021-12-06 19:47:25,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553576801] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125183610] [2021-12-06 19:47:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:25,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:25,980 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:25,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 19:47:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:26,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:47:26,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 19:47:26,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:26,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125183610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:26,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:26,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 19:47:26,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119252962] [2021-12-06 19:47:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:26,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:26,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:26,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:47:26,180 INFO L87 Difference]: Start difference. First operand 21620 states and 26615 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:47:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:27,614 INFO L93 Difference]: Finished difference Result 38782 states and 48165 transitions. [2021-12-06 19:47:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:47:27,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2021-12-06 19:47:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:27,650 INFO L225 Difference]: With dead ends: 38782 [2021-12-06 19:47:27,650 INFO L226 Difference]: Without dead ends: 21620 [2021-12-06 19:47:27,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:27,668 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 371 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:27,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 604 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:47:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21620 states. [2021-12-06 19:47:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21620 to 21620. [2021-12-06 19:47:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21620 states, 18066 states have (on average 1.1862614856636777) internal successors, (21431), 18420 states have internal predecessors, (21431), 1761 states have call successors, (1761), 1318 states have call predecessors, (1761), 1791 states have return successors, (3025), 1887 states have call predecessors, (3025), 1757 states have call successors, (3025) [2021-12-06 19:47:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 26217 transitions. [2021-12-06 19:47:28,995 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 26217 transitions. Word has length 165 [2021-12-06 19:47:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:28,995 INFO L470 AbstractCegarLoop]: Abstraction has 21620 states and 26217 transitions. [2021-12-06 19:47:28,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:47:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 26217 transitions. [2021-12-06 19:47:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:47:29,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:29,005 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2021-12-06 19:47:29,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 19:47:29,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 19:47:29,206 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1742273343, now seen corresponding path program 1 times [2021-12-06 19:47:29,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:29,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692245170] [2021-12-06 19:47:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:29,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:47:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:47:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:47:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:47:29,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:29,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692245170] [2021-12-06 19:47:29,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692245170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:29,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126092984] [2021-12-06 19:47:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:29,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:29,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:29,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:29,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 19:47:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:29,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:47:29,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:47:29,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:29,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126092984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:29,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:29,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:47:29,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144703989] [2021-12-06 19:47:29,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:29,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:29,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:47:29,456 INFO L87 Difference]: Start difference. First operand 21620 states and 26217 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2021-12-06 19:47:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:30,793 INFO L93 Difference]: Finished difference Result 38636 states and 47608 transitions. [2021-12-06 19:47:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:47:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 165 [2021-12-06 19:47:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:30,835 INFO L225 Difference]: With dead ends: 38636 [2021-12-06 19:47:30,835 INFO L226 Difference]: Without dead ends: 21476 [2021-12-06 19:47:30,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:47:30,863 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 49 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1314 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 [2021-12-06 19:47:30,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21476 states. [2021-12-06 19:47:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21476 to 20980. [2021-12-06 19:47:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20980 states, 17451 states have (on average 1.171394189444731) internal successors, (20442), 17788 states have internal predecessors, (20442), 1761 states have call successors, (1761), 1318 states have call predecessors, (1761), 1766 states have return successors, (2879), 1879 states have call predecessors, (2879), 1757 states have call successors, (2879) [2021-12-06 19:47:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20980 states to 20980 states and 25082 transitions. [2021-12-06 19:47:32,233 INFO L78 Accepts]: Start accepts. Automaton has 20980 states and 25082 transitions. Word has length 165 [2021-12-06 19:47:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:32,233 INFO L470 AbstractCegarLoop]: Abstraction has 20980 states and 25082 transitions. [2021-12-06 19:47:32,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2021-12-06 19:47:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20980 states and 25082 transitions. [2021-12-06 19:47:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:47:32,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:32,242 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2021-12-06 19:47:32,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 19:47:32,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:32,443 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1910661765, now seen corresponding path program 1 times [2021-12-06 19:47:32,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:32,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437353566] [2021-12-06 19:47:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:32,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:47:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:47:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:47:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-06 19:47:32,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:32,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437353566] [2021-12-06 19:47:32,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437353566] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:32,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848557967] [2021-12-06 19:47:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:32,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:32,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:32,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 19:47:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:32,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:47:32,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 19:47:32,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:32,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848557967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:32,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:32,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:47:32,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617957664] [2021-12-06 19:47:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:32,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:32,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:47:32,688 INFO L87 Difference]: Start difference. First operand 20980 states and 25082 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2021-12-06 19:47:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:33,822 INFO L93 Difference]: Finished difference Result 31947 states and 38555 transitions. [2021-12-06 19:47:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:47:33,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 165 [2021-12-06 19:47:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:33,850 INFO L225 Difference]: With dead ends: 31947 [2021-12-06 19:47:33,850 INFO L226 Difference]: Without dead ends: 15424 [2021-12-06 19:47:33,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:47:33,867 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 10 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1299 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 [2021-12-06 19:47:33,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15424 states. [2021-12-06 19:47:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15424 to 15360. [2021-12-06 19:47:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15360 states, 12785 states have (on average 1.164958936253422) internal successors, (14894), 12966 states have internal predecessors, (14894), 1321 states have call successors, (1321), 987 states have call predecessors, (1321), 1252 states have return successors, (1898), 1410 states have call predecessors, (1898), 1317 states have call successors, (1898) [2021-12-06 19:47:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15360 states to 15360 states and 18113 transitions. [2021-12-06 19:47:34,856 INFO L78 Accepts]: Start accepts. Automaton has 15360 states and 18113 transitions. Word has length 165 [2021-12-06 19:47:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:34,857 INFO L470 AbstractCegarLoop]: Abstraction has 15360 states and 18113 transitions. [2021-12-06 19:47:34,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2021-12-06 19:47:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 15360 states and 18113 transitions. [2021-12-06 19:47:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-06 19:47:34,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:34,863 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 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, 1, 1, 1, 1] [2021-12-06 19:47:34,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 19:47:35,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-06 19:47:35,065 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1582737387, now seen corresponding path program 1 times [2021-12-06 19:47:35,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:35,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793734873] [2021-12-06 19:47:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:35,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:47:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:47:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:47:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:47:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 19:47:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 19:47:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 19:47:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 19:47:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:47:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 19:47:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:47:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 19:47:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-06 19:47:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-06 19:47:35,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:35,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793734873] [2021-12-06 19:47:35,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793734873] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:35,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453625601] [2021-12-06 19:47:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:35,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:35,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:35,162 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:35,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 19:47:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:35,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:35,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 19:47:35,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:35,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453625601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:35,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:35,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 19:47:35,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269047462] [2021-12-06 19:47:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:35,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:35,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:35,406 INFO L87 Difference]: Start difference. First operand 15360 states and 18113 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 19:47:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:36,563 INFO L93 Difference]: Finished difference Result 24228 states and 28851 transitions. [2021-12-06 19:47:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2021-12-06 19:47:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:36,596 INFO L225 Difference]: With dead ends: 24228 [2021-12-06 19:47:36,596 INFO L226 Difference]: Without dead ends: 19794 [2021-12-06 19:47:36,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:36,608 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 52 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:36,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 645 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19794 states. [2021-12-06 19:47:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19794 to 19784. [2021-12-06 19:47:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19784 states, 16222 states have (on average 1.17186536801874) internal successors, (19010), 16463 states have internal predecessors, (19010), 1821 states have call successors, (1821), 1351 states have call predecessors, (1821), 1739 states have return successors, (2591), 1973 states have call predecessors, (2591), 1817 states have call successors, (2591) [2021-12-06 19:47:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19784 states to 19784 states and 23422 transitions. [2021-12-06 19:47:37,898 INFO L78 Accepts]: Start accepts. Automaton has 19784 states and 23422 transitions. Word has length 195 [2021-12-06 19:47:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:37,898 INFO L470 AbstractCegarLoop]: Abstraction has 19784 states and 23422 transitions. [2021-12-06 19:47:37,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 19:47:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 19784 states and 23422 transitions. [2021-12-06 19:47:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-06 19:47:37,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:37,906 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 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, 1, 1, 1, 1] [2021-12-06 19:47:37,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 19:47:38,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:38,107 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1814836631, now seen corresponding path program 1 times [2021-12-06 19:47:38,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:38,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619697938] [2021-12-06 19:47:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:38,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:47:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 19:47:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 19:47:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:47:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 19:47:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 19:47:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 19:47:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:47:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 19:47:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:47:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 19:47:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:47:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:47:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 19:47:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-06 19:47:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-06 19:47:38,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:38,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619697938] [2021-12-06 19:47:38,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619697938] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:38,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431835683] [2021-12-06 19:47:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:38,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:38,213 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:38,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 19:47:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:38,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:38,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-12-06 19:47:38,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:38,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431835683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:38,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:38,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 19:47:38,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008479360] [2021-12-06 19:47:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:38,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:38,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:38,437 INFO L87 Difference]: Start difference. First operand 19784 states and 23422 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-06 19:47:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:39,624 INFO L93 Difference]: Finished difference Result 26314 states and 31662 transitions. [2021-12-06 19:47:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:39,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2021-12-06 19:47:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:39,642 INFO L225 Difference]: With dead ends: 26314 [2021-12-06 19:47:39,643 INFO L226 Difference]: Without dead ends: 10915 [2021-12-06 19:47:39,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:39,657 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:39,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 311 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10915 states. [2021-12-06 19:47:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10915 to 10915. [2021-12-06 19:47:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10915 states, 9336 states have (on average 1.1476006855184233) internal successors, (10714), 9454 states have internal predecessors, (10714), 813 states have call successors, (813), 622 states have call predecessors, (813), 765 states have return successors, (1198), 840 states have call predecessors, (1198), 811 states have call successors, (1198) [2021-12-06 19:47:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10915 states to 10915 states and 12725 transitions. [2021-12-06 19:47:40,397 INFO L78 Accepts]: Start accepts. Automaton has 10915 states and 12725 transitions. Word has length 195 [2021-12-06 19:47:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:40,397 INFO L470 AbstractCegarLoop]: Abstraction has 10915 states and 12725 transitions. [2021-12-06 19:47:40,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-06 19:47:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10915 states and 12725 transitions. [2021-12-06 19:47:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-06 19:47:40,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:40,404 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:40,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-06 19:47:40,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:40,606 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash -55403990, now seen corresponding path program 1 times [2021-12-06 19:47:40,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:40,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91221218] [2021-12-06 19:47:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:40,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:47:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 19:47:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 19:47:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 19:47:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 19:47:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-06 19:47:40,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91221218] [2021-12-06 19:47:40,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91221218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137353519] [2021-12-06 19:47:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:40,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:40,691 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:40,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 19:47:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:40,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:47:40,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:47:40,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:40,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137353519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:40,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:40,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:47:40,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431072970] [2021-12-06 19:47:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:40,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:40,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:40,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:40,875 INFO L87 Difference]: Start difference. First operand 10915 states and 12725 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 19:47:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:41,208 INFO L93 Difference]: Finished difference Result 14334 states and 16689 transitions. [2021-12-06 19:47:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:41,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2021-12-06 19:47:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:41,214 INFO L225 Difference]: With dead ends: 14334 [2021-12-06 19:47:41,214 INFO L226 Difference]: Without dead ends: 3083 [2021-12-06 19:47:41,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:41,225 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 138 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:41,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 426 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2021-12-06 19:47:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3083. [2021-12-06 19:47:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2619 states have (on average 1.1263841160748378) internal successors, (2950), 2643 states have internal predecessors, (2950), 260 states have call successors, (260), 187 states have call predecessors, (260), 203 states have return successors, (295), 254 states have call predecessors, (295), 258 states have call successors, (295) [2021-12-06 19:47:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3505 transitions. [2021-12-06 19:47:41,417 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3505 transitions. Word has length 200 [2021-12-06 19:47:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:41,417 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 3505 transitions. [2021-12-06 19:47:41,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 19:47:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3505 transitions. [2021-12-06 19:47:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-06 19:47:41,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:41,420 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:41,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-06 19:47:41,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-06 19:47:41,621 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash 135104874, now seen corresponding path program 1 times [2021-12-06 19:47:41,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:41,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226573003] [2021-12-06 19:47:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:41,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:47:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:47:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:47:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 19:47:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-06 19:47:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-06 19:47:41,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226573003] [2021-12-06 19:47:41,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226573003] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135782182] [2021-12-06 19:47:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:41,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:41,713 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:41,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 19:47:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:41,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:47:41,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 19:47:41,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:41,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135782182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:41,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:41,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 19:47:41,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594237505] [2021-12-06 19:47:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:41,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:47:41,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:41,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:47:41,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:47:41,933 INFO L87 Difference]: Start difference. First operand 3083 states and 3505 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 19:47:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:42,115 INFO L93 Difference]: Finished difference Result 5467 states and 6252 transitions. [2021-12-06 19:47:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:47:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2021-12-06 19:47:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:42,121 INFO L225 Difference]: With dead ends: 5467 [2021-12-06 19:47:42,121 INFO L226 Difference]: Without dead ends: 3083 [2021-12-06 19:47:42,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:47:42,124 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 106 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:42,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 379 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2021-12-06 19:47:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3083. [2021-12-06 19:47:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2619 states have (on average 1.1156930126002291) internal successors, (2922), 2643 states have internal predecessors, (2922), 260 states have call successors, (260), 187 states have call predecessors, (260), 203 states have return successors, (295), 254 states have call predecessors, (295), 258 states have call successors, (295) [2021-12-06 19:47:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3477 transitions. [2021-12-06 19:47:42,322 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3477 transitions. Word has length 201 [2021-12-06 19:47:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:42,323 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 3477 transitions. [2021-12-06 19:47:42,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 19:47:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3477 transitions. [2021-12-06 19:47:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-06 19:47:42,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:42,325 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:42,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 19:47:42,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 19:47:42,526 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 171826558, now seen corresponding path program 1 times [2021-12-06 19:47:42,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145226819] [2021-12-06 19:47:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:42,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:47:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:47:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:47:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 19:47:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 19:47:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-06 19:47:42,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:42,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145226819] [2021-12-06 19:47:42,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145226819] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:42,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:42,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:47:42,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296561673] [2021-12-06 19:47:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:42,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:47:42,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:47:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:47:42,653 INFO L87 Difference]: Start difference. First operand 3083 states and 3477 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:47:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:43,267 INFO L93 Difference]: Finished difference Result 3489 states and 3916 transitions. [2021-12-06 19:47:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:47:43,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2021-12-06 19:47:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:43,274 INFO L225 Difference]: With dead ends: 3489 [2021-12-06 19:47:43,274 INFO L226 Difference]: Without dead ends: 3486 [2021-12-06 19:47:43,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:47:43,275 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 688 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:43,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 931 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:47:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-12-06 19:47:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3247. [2021-12-06 19:47:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2758 states have (on average 1.1153009427121103) internal successors, (3076), 2782 states have internal predecessors, (3076), 274 states have call successors, (274), 197 states have call predecessors, (274), 214 states have return successors, (311), 269 states have call predecessors, (311), 273 states have call successors, (311) [2021-12-06 19:47:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 3661 transitions. [2021-12-06 19:47:43,477 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 3661 transitions. Word has length 203 [2021-12-06 19:47:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:43,477 INFO L470 AbstractCegarLoop]: Abstraction has 3247 states and 3661 transitions. [2021-12-06 19:47:43,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:47:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 3661 transitions. [2021-12-06 19:47:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-06 19:47:43,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:43,480 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:43,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-06 19:47:43,480 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash -190863834, now seen corresponding path program 1 times [2021-12-06 19:47:43,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:43,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203448422] [2021-12-06 19:47:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:43,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:47:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:47:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:47:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:47:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:47:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:47:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:47:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:47:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 19:47:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:47:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 19:47:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-06 19:47:43,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203448422] [2021-12-06 19:47:43,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203448422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:43,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:43,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:47:43,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706363740] [2021-12-06 19:47:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:43,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:43,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:43,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:43,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:47:43,538 INFO L87 Difference]: Start difference. First operand 3247 states and 3661 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:47:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:43,896 INFO L93 Difference]: Finished difference Result 5308 states and 6094 transitions. [2021-12-06 19:47:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:47:43,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2021-12-06 19:47:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:43,903 INFO L225 Difference]: With dead ends: 5308 [2021-12-06 19:47:43,903 INFO L226 Difference]: Without dead ends: 3920 [2021-12-06 19:47:43,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:47:43,905 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 197 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:43,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 592 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:47:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-12-06 19:47:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3250. [2021-12-06 19:47:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 2761 states have (on average 1.115175660992394) internal successors, (3079), 2785 states have internal predecessors, (3079), 274 states have call successors, (274), 197 states have call predecessors, (274), 214 states have return successors, (311), 269 states have call predecessors, (311), 273 states have call successors, (311) [2021-12-06 19:47:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 3664 transitions. [2021-12-06 19:47:44,109 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 3664 transitions. Word has length 207 [2021-12-06 19:47:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:44,109 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 3664 transitions. [2021-12-06 19:47:44,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:47:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 3664 transitions. [2021-12-06 19:47:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-06 19:47:44,112 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:44,112 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:44,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-06 19:47:44,112 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash -392769361, now seen corresponding path program 1 times [2021-12-06 19:47:44,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623579278] [2021-12-06 19:47:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:44,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:47:44,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 19:47:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:47:44,221 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 19:47:44,221 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 19:47:44,222 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 19:47:44,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 19:47:44,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-06 19:47:44,226 INFO L732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:44,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:47:44,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:47:44 BoogieIcfgContainer [2021-12-06 19:47:44,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:47:44,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:47:44,365 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:47:44,365 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:47:44,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:46:42" (3/4) ... [2021-12-06 19:47:44,367 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 19:47:44,494 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:47:44,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:47:44,495 INFO L158 Benchmark]: Toolchain (without parser) took 63168.27ms. Allocated memory was 102.8MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 66.0MB in the beginning and 1.1GB in the end (delta: -999.3MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-06 19:47:44,495 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:47:44,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.07ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 71.4MB in the end (delta: -5.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 19:47:44,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 102.8MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:47:44,496 INFO L158 Benchmark]: Boogie Preprocessor took 30.16ms. Allocated memory is still 102.8MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:47:44,496 INFO L158 Benchmark]: RCFGBuilder took 487.46ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 75.3MB in the end (delta: -9.3MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2021-12-06 19:47:44,496 INFO L158 Benchmark]: TraceAbstraction took 62201.45ms. Allocated memory was 102.8MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 74.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-06 19:47:44,496 INFO L158 Benchmark]: Witness Printer took 129.33ms. Allocated memory is still 2.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-06 19:47:44,498 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.21ms. Allocated memory is still 102.8MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.07ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 71.4MB in the end (delta: -5.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 102.8MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.16ms. Allocated memory is still 102.8MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.46ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 75.3MB in the end (delta: -9.3MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 62201.45ms. Allocated memory was 102.8MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 74.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 129.33ms. Allocated memory is still 2.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 37.7MB). Peak memory consumption was 37.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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1137] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L827] COND TRUE t1_i == 1 [L828] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND TRUE t2_i == 1 [L833] t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] RET init_threads2() [L1139] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L940] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L945] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L950] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L955] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L960] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1139] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1140] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L776] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L786] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L788] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L795] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L807] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1140] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L973] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L978] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L983] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L988] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L993] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L998] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1144] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L872] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L845] COND TRUE m_st == 0 [L846] __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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L863] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] 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_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L696] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L698] t1_pc = 1 [L699] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND TRUE t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L732] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L734] t2_pc = 1 [L735] t2_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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L916] RET transmit2() [L872] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, token=0] [L875] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L842] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L845] COND TRUE m_st == 0 [L846] __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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L863] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L875] 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_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, token=0] [L875] tmp = exists_runnable_thread2() [L877] 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_2=2, E_M=2, fast_clk_edge=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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L640] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L646] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1046] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L769] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L777] COND TRUE E_1 == 1 [L778] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L788] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L807] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1046] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L646] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L647] E_1 = 2 [L648] m_pc = 1 [L649] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L688] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] token += 1 [L705] E_2 = 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_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L706] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L758] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L767] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L796] COND TRUE E_2 == 1 [L797] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L706] 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_2=1, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L707] E_2 = 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L696] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L698] t1_pc = 1 [L699] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND FALSE !(t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L724] COND TRUE t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L740] token += 1 [L741] 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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L758] COND TRUE E_M == 1 [L759] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] 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_2=2, E_M=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L743] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L732] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L734] t2_pc = 1 [L735] t2_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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L916] RET transmit2() [L872] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=-3, token=2] [L875] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L842] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L845] COND TRUE m_st == 0 [L846] __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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L863] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L875] 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_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=-3, token=2] [L875] tmp = exists_runnable_thread2() [L877] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=-3, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L632] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L654] COND FALSE !(token != local + 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L659] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L660] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L665] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L666] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L667] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L668] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L599] 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_2=2, E_M=2, fast_clk_edge=0, 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_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - 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 16 procedures, 257 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 62.0s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19450 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19071 mSDsluCounter, 34801 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21332 mSDsCounter, 3924 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15320 IncrementalHoareTripleChecker+Invalid, 19244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3924 mSolverCounterUnsat, 13469 mSDtfsCounter, 15320 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4189 GetRequests, 3763 SyntacticMatches, 4 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28251occurred in iteration=24, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 10789 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 7938 NumberOfCodeBlocks, 7938 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7675 ConstructedInterpolants, 0 QuantifiedInterpolants, 13666 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10138 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 55 InterpolantComputations, 37 PerfectInterpolantSequences, 4071/4403 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! [2021-12-06 19:47:44,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9c7f78-2f2d-4ed6-9572-8e152e0ebf1f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE