./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.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_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/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_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/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_43b09939-3088-468d-bc8f-6d55f1186f74/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 bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:56:48,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:56:48,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:56:48,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:56:48,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:56:48,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:56:48,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:56:48,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:56:48,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:56:48,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:56:48,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:56:48,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:56:48,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:56:48,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:56:48,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:56:48,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:56:48,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:56:48,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:56:48,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:56:48,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:56:48,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:56:48,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:56:48,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:56:48,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:56:48,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:56:48,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:56:48,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:56:48,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:56:48,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:56:48,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:56:48,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:56:48,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:56:48,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:56:48,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:56:48,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:56:48,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:56:48,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:56:48,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:56:48,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:56:48,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:56:48,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:56:48,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 23:56:48,535 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:56:48,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:56:48,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:56:48,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:56:48,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:56:48,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:56:48,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:56:48,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:56:48,538 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:56:48,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:56:48,538 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:56:48,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:56:48,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:56:48,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:56:48,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 23:56:48,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:56:48,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 23:56:48,540 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:56:48,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 23:56:48,540 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:56:48,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 23:56:48,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:56:48,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:56:48,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:56:48,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:56:48,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:56:48,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:56:48,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 23:56:48,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:56:48,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:56:48,542 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 23:56:48,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 23:56:48,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 23:56:48,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:56:48,543 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_43b09939-3088-468d-bc8f-6d55f1186f74/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_43b09939-3088-468d-bc8f-6d55f1186f74/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 -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2021-12-06 23:56:48,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:56:48,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:56:48,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:56:48,739 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:56:48,739 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:56:48,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2021-12-06 23:56:48,780 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/data/52aee2a22/50637f7a32f74881a64d405a3d18206d/FLAG13f66731c [2021-12-06 23:56:49,175 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:56:49,175 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2021-12-06 23:56:49,184 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/data/52aee2a22/50637f7a32f74881a64d405a3d18206d/FLAG13f66731c [2021-12-06 23:56:49,194 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/data/52aee2a22/50637f7a32f74881a64d405a3d18206d [2021-12-06 23:56:49,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:56:49,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:56:49,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:56:49,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:56:49,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:56:49,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368aea79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49, skipping insertion in model container [2021-12-06 23:56:49,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:56:49,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:56:49,340 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_43b09939-3088-468d-bc8f-6d55f1186f74/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2021-12-06 23:56:49,380 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_43b09939-3088-468d-bc8f-6d55f1186f74/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2021-12-06 23:56:49,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:56:49,417 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:56:49,426 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_43b09939-3088-468d-bc8f-6d55f1186f74/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2021-12-06 23:56:49,443 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_43b09939-3088-468d-bc8f-6d55f1186f74/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2021-12-06 23:56:49,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:56:49,478 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:56:49,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49 WrapperNode [2021-12-06 23:56:49,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:56:49,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:56:49,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:56:49,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:56:49,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,524 INFO L137 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 561 [2021-12-06 23:56:49,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:56:49,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:56:49,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:56:49,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:56:49,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:56:49,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:56:49,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:56:49,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:56:49,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (1/1) ... [2021-12-06 23:56:49,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:56:49,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:56:49,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:56:49,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:56:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:56:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 23:56:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 23:56:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 23:56:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 23:56:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 23:56:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 23:56:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 23:56:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 23:56:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 23:56:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 23:56:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 23:56:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 23:56:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 23:56:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 23:56:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 23:56:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 23:56:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 23:56:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 23:56:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 23:56:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 23:56:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 23:56:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 23:56:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:56:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 23:56:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 23:56:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 23:56:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 23:56:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:56:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:56:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 23:56:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 23:56:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-06 23:56:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-06 23:56:49,691 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:56:49,692 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:56:50,049 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-06 23:56:50,049 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 23:56:50,086 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:56:50,096 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:56:50,097 INFO L301 CfgBuilder]: Removed 10 assume(true) statements. [2021-12-06 23:56:50,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:56:50 BoogieIcfgContainer [2021-12-06 23:56:50,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:56:50,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:56:50,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:56:50,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:56:50,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:56:49" (1/3) ... [2021-12-06 23:56:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1c5d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:56:50, skipping insertion in model container [2021-12-06 23:56:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:49" (2/3) ... [2021-12-06 23:56:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1c5d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:56:50, skipping insertion in model container [2021-12-06 23:56:50,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:56:50" (3/3) ... [2021-12-06 23:56:50,108 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2021-12-06 23:56:50,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:56:50,114 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 23:56:50,150 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:56:50,155 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 23:56:50,155 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 23:56:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 229 states have (on average 1.5807860262008733) internal successors, (362), 237 states have internal predecessors, (362), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-06 23:56:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:56:50,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:50,183 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 23:56:50,183 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:50,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash 806435038, now seen corresponding path program 1 times [2021-12-06 23:56:50,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:50,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284978133] [2021-12-06 23:56:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:50,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:56:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:56:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:56:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:56:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:56:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:56:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:50,447 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 23:56:50,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:50,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284978133] [2021-12-06 23:56:50,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284978133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:50,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:50,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:56:50,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422208113] [2021-12-06 23:56:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:50,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:56:50,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:50,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:56:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:56:50,475 INFO L87 Difference]: Start difference. First operand has 282 states, 229 states have (on average 1.5807860262008733) internal successors, (362), 237 states have internal predecessors, (362), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) 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 23:56:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:51,073 INFO L93 Difference]: Finished difference Result 695 states and 1069 transitions. [2021-12-06 23:56:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:56:51,074 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 23:56:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:51,086 INFO L225 Difference]: With dead ends: 695 [2021-12-06 23:56:51,086 INFO L226 Difference]: Without dead ends: 422 [2021-12-06 23:56:51,090 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 23:56:51,093 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 731 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:51,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 1235 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:56:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-12-06 23:56:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 383. [2021-12-06 23:56:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2021-12-06 23:56:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 554 transitions. [2021-12-06 23:56:51,162 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 554 transitions. Word has length 65 [2021-12-06 23:56:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:51,163 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 554 transitions. [2021-12-06 23:56:51,163 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 23:56:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 554 transitions. [2021-12-06 23:56:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:56:51,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:51,167 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 23:56:51,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:56:51,167 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1809643618, now seen corresponding path program 1 times [2021-12-06 23:56:51,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:51,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807307417] [2021-12-06 23:56:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:51,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:56:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:56:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:56:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:56:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:56:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:56:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,271 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 23:56:51,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:51,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807307417] [2021-12-06 23:56:51,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807307417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:51,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:51,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:56:51,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407133486] [2021-12-06 23:56:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:51,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:56:51,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:56:51,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:56:51,275 INFO L87 Difference]: Start difference. First operand 383 states and 554 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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 23:56:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:51,842 INFO L93 Difference]: Finished difference Result 780 states and 1120 transitions. [2021-12-06 23:56:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:56:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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 23:56:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:51,847 INFO L225 Difference]: With dead ends: 780 [2021-12-06 23:56:51,847 INFO L226 Difference]: Without dead ends: 571 [2021-12-06 23:56:51,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 23:56:51,849 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 751 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:51,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 1809 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:56:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-06 23:56:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 495. [2021-12-06 23:56:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2021-12-06 23:56:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 714 transitions. [2021-12-06 23:56:51,888 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 714 transitions. Word has length 65 [2021-12-06 23:56:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:51,889 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 714 transitions. [2021-12-06 23:56:51,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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 23:56:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 714 transitions. [2021-12-06 23:56:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:56:51,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:51,892 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 23:56:51,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:56:51,892 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 456737568, now seen corresponding path program 1 times [2021-12-06 23:56:51,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:51,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532937406] [2021-12-06 23:56:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:51,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:56:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:56:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:56:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:56:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:56:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:56:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:51,996 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 23:56:51,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:51,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532937406] [2021-12-06 23:56:51,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532937406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:51,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:51,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:56:51,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384603657] [2021-12-06 23:56:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:51,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:56:51,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:56:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:56:51,999 INFO L87 Difference]: Start difference. First operand 495 states and 714 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 23:56:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:53,069 INFO L93 Difference]: Finished difference Result 2041 states and 2912 transitions. [2021-12-06 23:56:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 23:56:53,070 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 23:56:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:53,078 INFO L225 Difference]: With dead ends: 2041 [2021-12-06 23:56:53,078 INFO L226 Difference]: Without dead ends: 1708 [2021-12-06 23:56:53,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 23:56:53,082 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 2308 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:53,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2326 Valid, 2127 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 23:56:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2021-12-06 23:56:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1548. [2021-12-06 23:56:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2021-12-06 23:56:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2101 transitions. [2021-12-06 23:56:53,157 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2101 transitions. Word has length 65 [2021-12-06 23:56:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:53,157 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 2101 transitions. [2021-12-06 23:56:53,158 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 23:56:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2101 transitions. [2021-12-06 23:56:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 23:56:53,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:53,160 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 23:56:53,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:56:53,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1523190705, now seen corresponding path program 1 times [2021-12-06 23:56:53,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:53,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762478214] [2021-12-06 23:56:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:53,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:56:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:56:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:56:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:56:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 23:56:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 23:56:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,268 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 23:56:53,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:53,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762478214] [2021-12-06 23:56:53,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762478214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:53,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:53,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:56:53,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202914631] [2021-12-06 23:56:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:53,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:56:53,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:56:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:56:53,270 INFO L87 Difference]: Start difference. First operand 1548 states and 2101 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 23:56:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:53,760 INFO L93 Difference]: Finished difference Result 3076 states and 4180 transitions. [2021-12-06 23:56:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:56:53,761 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 23:56:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:53,769 INFO L225 Difference]: With dead ends: 3076 [2021-12-06 23:56:53,769 INFO L226 Difference]: Without dead ends: 1696 [2021-12-06 23:56:53,772 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 23:56:53,773 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 308 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:53,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 1922 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:56:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2021-12-06 23:56:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1588. [2021-12-06 23:56:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2021-12-06 23:56:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2135 transitions. [2021-12-06 23:56:53,844 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2135 transitions. Word has length 66 [2021-12-06 23:56:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:53,844 INFO L470 AbstractCegarLoop]: Abstraction has 1588 states and 2135 transitions. [2021-12-06 23:56:53,844 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 23:56:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2135 transitions. [2021-12-06 23:56:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 23:56:53,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:53,846 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 23:56:53,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:56:53,846 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 493831407, now seen corresponding path program 1 times [2021-12-06 23:56:53,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:53,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720118971] [2021-12-06 23:56:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:53,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:56:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:56:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:56:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:56:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 23:56:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 23:56:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:53,934 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 23:56:53,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:53,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720118971] [2021-12-06 23:56:53,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720118971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:53,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:53,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:56:53,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487646374] [2021-12-06 23:56:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:53,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:56:53,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:56:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:56:53,936 INFO L87 Difference]: Start difference. First operand 1588 states and 2135 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 23:56:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:55,087 INFO L93 Difference]: Finished difference Result 5160 states and 7009 transitions. [2021-12-06 23:56:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 23:56:55,088 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 23:56:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:55,100 INFO L225 Difference]: With dead ends: 5160 [2021-12-06 23:56:55,100 INFO L226 Difference]: Without dead ends: 1979 [2021-12-06 23:56:55,108 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 23:56:55,109 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 2653 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2671 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:55,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2671 Valid, 1900 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-06 23:56:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2021-12-06 23:56:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1799. [2021-12-06 23:56:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2021-12-06 23:56:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2347 transitions. [2021-12-06 23:56:55,183 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2347 transitions. Word has length 66 [2021-12-06 23:56:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:55,183 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2347 transitions. [2021-12-06 23:56:55,184 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 23:56:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2347 transitions. [2021-12-06 23:56:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:56:55,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:55,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:55,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:56:55,185 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1802213968, now seen corresponding path program 1 times [2021-12-06 23:56:55,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916165512] [2021-12-06 23:56:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:55,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:56:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:56:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:56:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:56:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,239 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 23:56:55,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:55,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916165512] [2021-12-06 23:56:55,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916165512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:55,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:55,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:56:55,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846705773] [2021-12-06 23:56:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:55,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:56:55,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:56:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:56:55,241 INFO L87 Difference]: Start difference. First operand 1799 states and 2347 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:56:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:55,645 INFO L93 Difference]: Finished difference Result 1993 states and 2647 transitions. [2021-12-06 23:56:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:56:55,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2021-12-06 23:56:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:55,655 INFO L225 Difference]: With dead ends: 1993 [2021-12-06 23:56:55,655 INFO L226 Difference]: Without dead ends: 1842 [2021-12-06 23:56:55,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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 23:56:55,657 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 479 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:55,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 802 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:56:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-12-06 23:56:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1799. [2021-12-06 23:56:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2021-12-06 23:56:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2346 transitions. [2021-12-06 23:56:55,755 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2346 transitions. Word has length 80 [2021-12-06 23:56:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:55,755 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2346 transitions. [2021-12-06 23:56:55,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:56:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2346 transitions. [2021-12-06 23:56:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:56:55,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:55,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:55,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:56:55,757 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash -106243822, now seen corresponding path program 1 times [2021-12-06 23:56:55,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:55,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685707728] [2021-12-06 23:56:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:55,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:56:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:56:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:56:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:56:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:55,823 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 23:56:55,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:55,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685707728] [2021-12-06 23:56:55,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685707728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:55,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:55,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:56:55,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247671312] [2021-12-06 23:56:55,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:55,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:56:55,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:55,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:56:55,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:56:55,825 INFO L87 Difference]: Start difference. First operand 1799 states and 2346 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 23:56:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:56,412 INFO L93 Difference]: Finished difference Result 2181 states and 2937 transitions. [2021-12-06 23:56:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:56:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2021-12-06 23:56:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:56,423 INFO L225 Difference]: With dead ends: 2181 [2021-12-06 23:56:56,423 INFO L226 Difference]: Without dead ends: 2033 [2021-12-06 23:56:56,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:56:56,426 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 778 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:56,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 1044 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:56:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2021-12-06 23:56:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1946. [2021-12-06 23:56:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2021-12-06 23:56:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2570 transitions. [2021-12-06 23:56:56,545 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2570 transitions. Word has length 80 [2021-12-06 23:56:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:56,546 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 2570 transitions. [2021-12-06 23:56:56,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 23:56:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2570 transitions. [2021-12-06 23:56:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:56:56,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:56,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:56,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:56:56,547 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1347684338, now seen corresponding path program 1 times [2021-12-06 23:56:56,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:56,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653052992] [2021-12-06 23:56:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:56,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:56:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:56:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:56:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:56:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:56,613 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 23:56:56,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653052992] [2021-12-06 23:56:56,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653052992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:56,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:56,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:56,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228162066] [2021-12-06 23:56:56,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:56,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:56,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:56,616 INFO L87 Difference]: Start difference. First operand 1946 states and 2570 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:56:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:57,321 INFO L93 Difference]: Finished difference Result 2519 states and 3450 transitions. [2021-12-06 23:56:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:56:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:56:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:57,329 INFO L225 Difference]: With dead ends: 2519 [2021-12-06 23:56:57,329 INFO L226 Difference]: Without dead ends: 2224 [2021-12-06 23:56:57,330 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 23:56:57,331 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 769 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:57,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 1615 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:56:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2021-12-06 23:56:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2084. [2021-12-06 23:56:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2021-12-06 23:56:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2775 transitions. [2021-12-06 23:56:57,422 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2775 transitions. Word has length 80 [2021-12-06 23:56:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:57,422 INFO L470 AbstractCegarLoop]: Abstraction has 2084 states and 2775 transitions. [2021-12-06 23:56:57,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:56:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2775 transitions. [2021-12-06 23:56:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:56:57,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:57,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:57,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:56:57,424 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1261103120, now seen corresponding path program 1 times [2021-12-06 23:56:57,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:57,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721950697] [2021-12-06 23:56:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:57,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:56:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:56:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:56:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:56:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:57,480 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 23:56:57,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:57,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721950697] [2021-12-06 23:56:57,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721950697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:57,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:57,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:57,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052553857] [2021-12-06 23:56:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:57,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:57,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:57,481 INFO L87 Difference]: Start difference. First operand 2084 states and 2775 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:56:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:58,251 INFO L93 Difference]: Finished difference Result 3016 states and 4203 transitions. [2021-12-06 23:56:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:56:58,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:56:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:58,265 INFO L225 Difference]: With dead ends: 3016 [2021-12-06 23:56:58,265 INFO L226 Difference]: Without dead ends: 2583 [2021-12-06 23:56:58,268 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 23:56:58,269 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 766 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:58,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 1603 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:56:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2021-12-06 23:56:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2361. [2021-12-06 23:56:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2021-12-06 23:56:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3190 transitions. [2021-12-06 23:56:58,379 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3190 transitions. Word has length 80 [2021-12-06 23:56:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:58,379 INFO L470 AbstractCegarLoop]: Abstraction has 2361 states and 3190 transitions. [2021-12-06 23:56:58,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:56:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3190 transitions. [2021-12-06 23:56:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:56:58,380 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:58,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:58,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:56:58,381 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1206710222, now seen corresponding path program 1 times [2021-12-06 23:56:58,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:58,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130379166] [2021-12-06 23:56:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:58,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:56:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:58,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:56:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:56:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:58,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:56:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:58,441 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 23:56:58,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130379166] [2021-12-06 23:56:58,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130379166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:58,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:58,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:58,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655901532] [2021-12-06 23:56:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:58,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:58,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:58,443 INFO L87 Difference]: Start difference. First operand 2361 states and 3190 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:56:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:56:59,190 INFO L93 Difference]: Finished difference Result 3977 states and 5658 transitions. [2021-12-06 23:56:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:56:59,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:56:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:56:59,204 INFO L225 Difference]: With dead ends: 3977 [2021-12-06 23:56:59,204 INFO L226 Difference]: Without dead ends: 3267 [2021-12-06 23:56:59,206 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 23:56:59,207 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 806 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:56:59,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 1238 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:56:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2021-12-06 23:56:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 2916. [2021-12-06 23:56:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2021-12-06 23:56:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4026 transitions. [2021-12-06 23:56:59,361 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4026 transitions. Word has length 80 [2021-12-06 23:56:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:56:59,361 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 4026 transitions. [2021-12-06 23:56:59,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:56:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4026 transitions. [2021-12-06 23:56:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:56:59,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:56:59,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:59,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:56:59,364 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:56:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 789313616, now seen corresponding path program 1 times [2021-12-06 23:56:59,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147466583] [2021-12-06 23:56:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:59,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:56:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:56:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:59,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:56:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:56:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:56:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:59,421 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 23:56:59,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:59,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147466583] [2021-12-06 23:56:59,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147466583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:59,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:59,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:59,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770765176] [2021-12-06 23:56:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:59,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:59,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:59,423 INFO L87 Difference]: Start difference. First operand 2916 states and 4026 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:00,392 INFO L93 Difference]: Finished difference Result 6306 states and 9178 transitions. [2021-12-06 23:57:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:57:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:57:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:00,412 INFO L225 Difference]: With dead ends: 6306 [2021-12-06 23:57:00,412 INFO L226 Difference]: Without dead ends: 5041 [2021-12-06 23:57:00,415 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 23:57:00,416 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 791 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:00,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [812 Valid, 1641 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 23:57:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states. [2021-12-06 23:57:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 4007. [2021-12-06 23:57:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 3332 states have (on average 1.427671068427371) internal successors, (4757), 3374 states have internal predecessors, (4757), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2021-12-06 23:57:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5690 transitions. [2021-12-06 23:57:00,586 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5690 transitions. Word has length 80 [2021-12-06 23:57:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:00,586 INFO L470 AbstractCegarLoop]: Abstraction has 4007 states and 5690 transitions. [2021-12-06 23:57:00,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5690 transitions. [2021-12-06 23:57:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:57:00,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:00,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:57:00,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:57:00,589 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1468585870, now seen corresponding path program 1 times [2021-12-06 23:57:00,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:00,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932090447] [2021-12-06 23:57:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:00,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:00,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 23:57:00,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:00,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932090447] [2021-12-06 23:57:00,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932090447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:00,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:00,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:57:00,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109796399] [2021-12-06 23:57:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:00,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:57:00,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:57:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:57:00,645 INFO L87 Difference]: Start difference. First operand 4007 states and 5690 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:01,673 INFO L93 Difference]: Finished difference Result 10291 states and 15280 transitions. [2021-12-06 23:57:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:57:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:57:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:01,702 INFO L225 Difference]: With dead ends: 10291 [2021-12-06 23:57:01,702 INFO L226 Difference]: Without dead ends: 7935 [2021-12-06 23:57:01,707 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 23:57:01,708 INFO L933 BasicCegarLoop]: 495 mSDtfsCounter, 852 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:01,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 1575 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:57:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2021-12-06 23:57:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 6018. [2021-12-06 23:57:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6018 states, 5063 states have (on average 1.4463756666008296) internal successors, (7323), 5121 states have internal predecessors, (7323), 563 states have call successors, (563), 332 states have call predecessors, (563), 390 states have return successors, (884), 598 states have call predecessors, (884), 559 states have call successors, (884) [2021-12-06 23:57:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6018 states to 6018 states and 8770 transitions. [2021-12-06 23:57:01,992 INFO L78 Accepts]: Start accepts. Automaton has 6018 states and 8770 transitions. Word has length 80 [2021-12-06 23:57:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:01,992 INFO L470 AbstractCegarLoop]: Abstraction has 6018 states and 8770 transitions. [2021-12-06 23:57:01,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6018 states and 8770 transitions. [2021-12-06 23:57:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:57:01,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:01,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:57:01,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 23:57:01,997 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -864806768, now seen corresponding path program 1 times [2021-12-06 23:57:01,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:01,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884509912] [2021-12-06 23:57:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:01,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:02,055 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 23:57:02,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:02,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884509912] [2021-12-06 23:57:02,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884509912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:02,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:02,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:57:02,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021299833] [2021-12-06 23:57:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:02,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:57:02,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:57:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:57:02,056 INFO L87 Difference]: Start difference. First operand 6018 states and 8770 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:03,212 INFO L93 Difference]: Finished difference Result 17005 states and 25646 transitions. [2021-12-06 23:57:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:57:03,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:57:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:03,242 INFO L225 Difference]: With dead ends: 17005 [2021-12-06 23:57:03,242 INFO L226 Difference]: Without dead ends: 12638 [2021-12-06 23:57:03,251 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 23:57:03,252 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 770 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:03,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 1572 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:57:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12638 states. [2021-12-06 23:57:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12638 to 10214. [2021-12-06 23:57:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10214 states, 8715 states have (on average 1.4709122203098106) internal successors, (12819), 8805 states have internal predecessors, (12819), 883 states have call successors, (883), 524 states have call predecessors, (883), 614 states have return successors, (1722), 950 states have call predecessors, (1722), 879 states have call successors, (1722) [2021-12-06 23:57:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 15424 transitions. [2021-12-06 23:57:03,765 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 15424 transitions. Word has length 80 [2021-12-06 23:57:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:03,765 INFO L470 AbstractCegarLoop]: Abstraction has 10214 states and 15424 transitions. [2021-12-06 23:57:03,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 15424 transitions. [2021-12-06 23:57:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:57:03,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:03,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:57:03,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 23:57:03,772 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash -304106990, now seen corresponding path program 1 times [2021-12-06 23:57:03,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:03,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270258875] [2021-12-06 23:57:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:03,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:03,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:03,835 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 23:57:03,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270258875] [2021-12-06 23:57:03,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270258875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:03,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:03,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:57:03,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655384408] [2021-12-06 23:57:03,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:03,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:57:03,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:57:03,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:57:03,837 INFO L87 Difference]: Start difference. First operand 10214 states and 15424 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:05,170 INFO L93 Difference]: Finished difference Result 24408 states and 37136 transitions. [2021-12-06 23:57:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:57:05,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:57:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:05,230 INFO L225 Difference]: With dead ends: 24408 [2021-12-06 23:57:05,231 INFO L226 Difference]: Without dead ends: 15846 [2021-12-06 23:57:05,253 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 23:57:05,254 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 472 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:05,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1427 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:57:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15846 states. [2021-12-06 23:57:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15846 to 10409. [2021-12-06 23:57:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10409 states, 8910 states have (on average 1.4606060606060607) internal successors, (13014), 9000 states have internal predecessors, (13014), 883 states have call successors, (883), 524 states have call predecessors, (883), 614 states have return successors, (1722), 950 states have call predecessors, (1722), 879 states have call successors, (1722) [2021-12-06 23:57:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 15619 transitions. [2021-12-06 23:57:05,764 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 15619 transitions. Word has length 80 [2021-12-06 23:57:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:05,764 INFO L470 AbstractCegarLoop]: Abstraction has 10409 states and 15619 transitions. [2021-12-06 23:57:05,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 15619 transitions. [2021-12-06 23:57:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:57:05,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:05,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:57:05,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 23:57:05,770 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash -785187248, now seen corresponding path program 1 times [2021-12-06 23:57:05,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:05,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797876631] [2021-12-06 23:57:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:05,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:05,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:05,857 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 23:57:05,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:05,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797876631] [2021-12-06 23:57:05,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797876631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:05,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:05,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:57:05,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65915597] [2021-12-06 23:57:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:05,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:57:05,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:57:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:57:05,858 INFO L87 Difference]: Start difference. First operand 10409 states and 15619 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:08,343 INFO L93 Difference]: Finished difference Result 39903 states and 61872 transitions. [2021-12-06 23:57:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 23:57:08,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:57:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:08,417 INFO L225 Difference]: With dead ends: 39903 [2021-12-06 23:57:08,417 INFO L226 Difference]: Without dead ends: 31146 [2021-12-06 23:57:08,445 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 23:57:08,445 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 1722 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:08,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1750 Valid, 1427 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-06 23:57:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31146 states. [2021-12-06 23:57:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31146 to 26249. [2021-12-06 23:57:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26249 states, 22535 states have (on average 1.4613712003550032) internal successors, (32932), 22852 states have internal predecessors, (32932), 2192 states have call successors, (2192), 1302 states have call predecessors, (2192), 1520 states have return successors, (4717), 2160 states have call predecessors, (4717), 2188 states have call successors, (4717) [2021-12-06 23:57:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26249 states to 26249 states and 39841 transitions. [2021-12-06 23:57:09,735 INFO L78 Accepts]: Start accepts. Automaton has 26249 states and 39841 transitions. Word has length 80 [2021-12-06 23:57:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:09,735 INFO L470 AbstractCegarLoop]: Abstraction has 26249 states and 39841 transitions. [2021-12-06 23:57:09,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 23:57:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 26249 states and 39841 transitions. [2021-12-06 23:57:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 23:57:09,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:09,747 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 23:57:09,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 23:57:09,747 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 658635861, now seen corresponding path program 1 times [2021-12-06 23:57:09,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18421379] [2021-12-06 23:57:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:09,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:57:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:57:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:57:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:57:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:57:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:09,824 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 23:57:09,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:09,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18421379] [2021-12-06 23:57:09,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18421379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:09,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:09,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:57:09,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287325887] [2021-12-06 23:57:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:09,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:57:09,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:09,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:57:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:57:09,825 INFO L87 Difference]: Start difference. First operand 26249 states and 39841 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 23:57:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:11,418 INFO L93 Difference]: Finished difference Result 28074 states and 42243 transitions. [2021-12-06 23:57:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:57:11,418 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 23:57:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:11,479 INFO L225 Difference]: With dead ends: 28074 [2021-12-06 23:57:11,479 INFO L226 Difference]: Without dead ends: 26443 [2021-12-06 23:57:11,496 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 23:57:11,496 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 303 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:11,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 1851 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:57:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26443 states. [2021-12-06 23:57:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26443 to 26309. [2021-12-06 23:57:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26309 states, 22583 states have (on average 1.4601248726918479) internal successors, (32974), 22900 states have internal predecessors, (32974), 2192 states have call successors, (2192), 1302 states have call predecessors, (2192), 1532 states have return successors, (4729), 2172 states have call predecessors, (4729), 2188 states have call successors, (4729) [2021-12-06 23:57:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26309 states to 26309 states and 39895 transitions. [2021-12-06 23:57:12,730 INFO L78 Accepts]: Start accepts. Automaton has 26309 states and 39895 transitions. Word has length 91 [2021-12-06 23:57:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:12,730 INFO L470 AbstractCegarLoop]: Abstraction has 26309 states and 39895 transitions. [2021-12-06 23:57:12,730 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 23:57:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26309 states and 39895 transitions. [2021-12-06 23:57:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 23:57:12,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:12,742 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 23:57:12,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 23:57:12,742 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1102536535, now seen corresponding path program 1 times [2021-12-06 23:57:12,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:12,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876565882] [2021-12-06 23:57:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:12,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:57:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:57:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:57:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:57:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:57:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:12,808 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 23:57:12,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876565882] [2021-12-06 23:57:12,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876565882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:12,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:12,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:57:12,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890063736] [2021-12-06 23:57:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:12,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:57:12,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:57:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:57:12,809 INFO L87 Difference]: Start difference. First operand 26309 states and 39895 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 23:57:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:14,246 INFO L93 Difference]: Finished difference Result 27836 states and 41859 transitions. [2021-12-06 23:57:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 23:57:14,247 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 23:57:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:14,304 INFO L225 Difference]: With dead ends: 27836 [2021-12-06 23:57:14,304 INFO L226 Difference]: Without dead ends: 26383 [2021-12-06 23:57:14,318 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 23:57:14,318 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 939 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:14,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [962 Valid, 1261 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:57:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26383 states. [2021-12-06 23:57:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26383 to 26088. [2021-12-06 23:57:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26088 states, 22415 states have (on average 1.461342850769574) internal successors, (32756), 22727 states have internal predecessors, (32756), 2164 states have call successors, (2164), 1283 states have call predecessors, (2164), 1507 states have return successors, (4689), 2142 states have call predecessors, (4689), 2160 states have call successors, (4689) [2021-12-06 23:57:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26088 states to 26088 states and 39609 transitions. [2021-12-06 23:57:15,820 INFO L78 Accepts]: Start accepts. Automaton has 26088 states and 39609 transitions. Word has length 91 [2021-12-06 23:57:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:15,820 INFO L470 AbstractCegarLoop]: Abstraction has 26088 states and 39609 transitions. [2021-12-06 23:57:15,820 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 23:57:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26088 states and 39609 transitions. [2021-12-06 23:57:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 23:57:15,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:15,831 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 23:57:15,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 23:57:15,831 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1253268715, now seen corresponding path program 1 times [2021-12-06 23:57:15,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:15,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551157274] [2021-12-06 23:57:15,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:15,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:57:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:57:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:57:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:57:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:57:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:15,885 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 23:57:15,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:15,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551157274] [2021-12-06 23:57:15,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551157274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:15,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:15,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:57:15,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89501520] [2021-12-06 23:57:15,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:15,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:57:15,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:57:15,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:57:15,887 INFO L87 Difference]: Start difference. First operand 26088 states and 39609 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 23:57:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:17,181 INFO L93 Difference]: Finished difference Result 29240 states and 43721 transitions. [2021-12-06 23:57:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:57:17,182 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 23:57:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:17,251 INFO L225 Difference]: With dead ends: 29240 [2021-12-06 23:57:17,251 INFO L226 Difference]: Without dead ends: 27771 [2021-12-06 23:57:17,265 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 23:57:17,265 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 863 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:17,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 983 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:57:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27771 states. [2021-12-06 23:57:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27771 to 27557. [2021-12-06 23:57:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27557 states, 23564 states have (on average 1.4506874893905959) internal successors, (34184), 23905 states have internal predecessors, (34184), 2325 states have call successors, (2325), 1396 states have call predecessors, (2325), 1666 states have return successors, (4972), 2321 states have call predecessors, (4972), 2321 states have call successors, (4972) [2021-12-06 23:57:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27557 states to 27557 states and 41481 transitions. [2021-12-06 23:57:18,571 INFO L78 Accepts]: Start accepts. Automaton has 27557 states and 41481 transitions. Word has length 91 [2021-12-06 23:57:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:18,571 INFO L470 AbstractCegarLoop]: Abstraction has 27557 states and 41481 transitions. [2021-12-06 23:57:18,571 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 23:57:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27557 states and 41481 transitions. [2021-12-06 23:57:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 23:57:18,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:18,582 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 23:57:18,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 23:57:18,583 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1983860503, now seen corresponding path program 1 times [2021-12-06 23:57:18,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138021795] [2021-12-06 23:57:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:18,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:57:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:57:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:57:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:57:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:57:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:18,628 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 23:57:18,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:18,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138021795] [2021-12-06 23:57:18,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138021795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:18,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:18,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:57:18,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355298649] [2021-12-06 23:57:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:18,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:57:18,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:57:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:57:18,630 INFO L87 Difference]: Start difference. First operand 27557 states and 41481 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 23:57:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:19,831 INFO L93 Difference]: Finished difference Result 29141 states and 43465 transitions. [2021-12-06 23:57:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 23:57:19,832 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 23:57:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:19,888 INFO L225 Difference]: With dead ends: 29141 [2021-12-06 23:57:19,888 INFO L226 Difference]: Without dead ends: 26203 [2021-12-06 23:57:19,901 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 23:57:19,902 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 560 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:19,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 851 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:57:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26203 states. [2021-12-06 23:57:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26203 to 26088. [2021-12-06 23:57:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26088 states, 22415 states have (on average 1.4596921704215926) internal successors, (32719), 22727 states have internal predecessors, (32719), 2164 states have call successors, (2164), 1283 states have call predecessors, (2164), 1507 states have return successors, (4689), 2142 states have call predecessors, (4689), 2160 states have call successors, (4689) [2021-12-06 23:57:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26088 states to 26088 states and 39572 transitions. [2021-12-06 23:57:21,218 INFO L78 Accepts]: Start accepts. Automaton has 26088 states and 39572 transitions. Word has length 91 [2021-12-06 23:57:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:21,219 INFO L470 AbstractCegarLoop]: Abstraction has 26088 states and 39572 transitions. [2021-12-06 23:57:21,219 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 23:57:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26088 states and 39572 transitions. [2021-12-06 23:57:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-06 23:57:21,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:21,232 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 23:57:21,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 23:57:21,232 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 119295803, now seen corresponding path program 1 times [2021-12-06 23:57:21,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124106280] [2021-12-06 23:57:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:21,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:57:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:57:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:57:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:57:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:57:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 23:57:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:21,291 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 23:57:21,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124106280] [2021-12-06 23:57:21,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124106280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:21,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:57:21,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:57:21,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630949288] [2021-12-06 23:57:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:21,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:57:21,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:21,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:57:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:57:21,292 INFO L87 Difference]: Start difference. First operand 26088 states and 39572 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 23:57:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:23,107 INFO L93 Difference]: Finished difference Result 28506 states and 42655 transitions. [2021-12-06 23:57:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 23:57:23,107 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 23:57:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:23,170 INFO L225 Difference]: With dead ends: 28506 [2021-12-06 23:57:23,170 INFO L226 Difference]: Without dead ends: 26886 [2021-12-06 23:57:23,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-06 23:57:23,187 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1621 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:57:23,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 1297 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:57:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26886 states. [2021-12-06 23:57:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26886 to 26709. [2021-12-06 23:57:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26709 states, 22882 states have (on average 1.4535879730792762) internal successors, (33261), 23202 states have internal predecessors, (33261), 2241 states have call successors, (2241), 1331 states have call predecessors, (2241), 1584 states have return successors, (4820), 2240 states have call predecessors, (4820), 2237 states have call successors, (4820) [2021-12-06 23:57:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26709 states to 26709 states and 40322 transitions. [2021-12-06 23:57:24,467 INFO L78 Accepts]: Start accepts. Automaton has 26709 states and 40322 transitions. Word has length 92 [2021-12-06 23:57:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:24,467 INFO L470 AbstractCegarLoop]: Abstraction has 26709 states and 40322 transitions. [2021-12-06 23:57:24,467 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 23:57:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 26709 states and 40322 transitions. [2021-12-06 23:57:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-06 23:57:24,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:24,496 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, 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 23:57:24,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 23:57:24,497 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1316817982, now seen corresponding path program 1 times [2021-12-06 23:57:24,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:24,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694816127] [2021-12-06 23:57:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:24,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:57:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:57:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 23:57:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 23:57:24,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694816127] [2021-12-06 23:57:24,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694816127] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:57:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054037638] [2021-12-06 23:57:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:24,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:57:24,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:57:24,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 23:57:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:24,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:57:24,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:57:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 23:57:24,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:57:24,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054037638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:24,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:57:24,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 23:57:24,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837431485] [2021-12-06 23:57:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:24,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:57:24,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:57:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:57:24,767 INFO L87 Difference]: Start difference. First operand 26709 states and 40322 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:57:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:26,876 INFO L93 Difference]: Finished difference Result 75186 states and 115750 transitions. [2021-12-06 23:57:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:57:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 129 [2021-12-06 23:57:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:27,013 INFO L225 Difference]: With dead ends: 75186 [2021-12-06 23:57:27,014 INFO L226 Difference]: Without dead ends: 50589 [2021-12-06 23:57:27,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 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 23:57:27,070 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 328 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 600 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 23:57:27,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 600 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:57:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50589 states. [2021-12-06 23:57:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50589 to 50193. [2021-12-06 23:57:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50193 states, 43128 states have (on average 1.4589825635318123) internal successors, (62923), 43739 states have internal predecessors, (62923), 4127 states have call successors, (4127), 2491 states have call predecessors, (4127), 2936 states have return successors, (9071), 4027 states have call predecessors, (9071), 4123 states have call successors, (9071) [2021-12-06 23:57:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50193 states to 50193 states and 76121 transitions. [2021-12-06 23:57:29,539 INFO L78 Accepts]: Start accepts. Automaton has 50193 states and 76121 transitions. Word has length 129 [2021-12-06 23:57:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:29,539 INFO L470 AbstractCegarLoop]: Abstraction has 50193 states and 76121 transitions. [2021-12-06 23:57:29,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:57:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 50193 states and 76121 transitions. [2021-12-06 23:57:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-06 23:57:29,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:29,586 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, 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 23:57:29,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 23:57:29,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-06 23:57:29,787 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 42487134, now seen corresponding path program 1 times [2021-12-06 23:57:29,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:29,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719953142] [2021-12-06 23:57:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:29,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:57:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:57:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 23:57:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 23:57:29,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:29,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719953142] [2021-12-06 23:57:29,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719953142] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:57:29,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928430859] [2021-12-06 23:57:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:29,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:57:29,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:57:29,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 23:57:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:29,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:57:29,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:57:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:57:30,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:57:30,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928430859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:30,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:57:30,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:57:30,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298832526] [2021-12-06 23:57:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:30,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:57:30,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:57:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:57:30,082 INFO L87 Difference]: Start difference. First operand 50193 states and 76121 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 23:57:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:34,492 INFO L93 Difference]: Finished difference Result 144020 states and 220552 transitions. [2021-12-06 23:57:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:57:34,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 129 [2021-12-06 23:57:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:34,653 INFO L225 Difference]: With dead ends: 144020 [2021-12-06 23:57:34,653 INFO L226 Difference]: Without dead ends: 58394 [2021-12-06 23:57:34,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 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 23:57:34,764 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 193 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 953 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 23:57:34,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 953 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:57:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58394 states. [2021-12-06 23:57:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58394 to 58394. [2021-12-06 23:57:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58394 states, 50222 states have (on average 1.4571900760622836) internal successors, (73183), 50897 states have internal predecessors, (73183), 4774 states have call successors, (4774), 2887 states have call predecessors, (4774), 3396 states have return successors, (10457), 4674 states have call predecessors, (10457), 4770 states have call successors, (10457) [2021-12-06 23:57:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58394 states to 58394 states and 88414 transitions. [2021-12-06 23:57:37,583 INFO L78 Accepts]: Start accepts. Automaton has 58394 states and 88414 transitions. Word has length 129 [2021-12-06 23:57:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:37,583 INFO L470 AbstractCegarLoop]: Abstraction has 58394 states and 88414 transitions. [2021-12-06 23:57:37,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 23:57:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 58394 states and 88414 transitions. [2021-12-06 23:57:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 23:57:37,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:37,650 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 23:57:37,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 23:57:37,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 23:57:37,852 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2097013156, now seen corresponding path program 1 times [2021-12-06 23:57:37,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:37,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871813864] [2021-12-06 23:57:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:37,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:57:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:57:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:57:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:57:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:57:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 23:57:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:57:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 23:57:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:57:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:57:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:57:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 23:57:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 23:57:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-06 23:57:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 23:57:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:37,960 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 23:57:37,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871813864] [2021-12-06 23:57:37,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871813864] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:57:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857200124] [2021-12-06 23:57:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:37,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:57:37,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:57:37,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 23:57:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:38,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:57:38,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:57:38,201 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 23:57:38,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:57:38,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857200124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:38,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:57:38,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 23:57:38,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270013230] [2021-12-06 23:57:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:38,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:57:38,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:57:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:57:38,202 INFO L87 Difference]: Start difference. First operand 58394 states and 88414 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 23:57:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:40,577 INFO L93 Difference]: Finished difference Result 62320 states and 93243 transitions. [2021-12-06 23:57:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:57:40,577 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 23:57:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:40,738 INFO L225 Difference]: With dead ends: 62320 [2021-12-06 23:57:40,738 INFO L226 Difference]: Without dead ends: 60306 [2021-12-06 23:57:40,770 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 23:57:40,771 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 61 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 753 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 23:57:40,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 753 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:57:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60306 states. [2021-12-06 23:57:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60306 to 60264. [2021-12-06 23:57:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60264 states, 51679 states have (on average 1.4500474080380812) internal successors, (74937), 52377 states have internal predecessors, (74937), 4981 states have call successors, (4981), 3048 states have call predecessors, (4981), 3602 states have return successors, (10725), 4903 states have call predecessors, (10725), 4977 states have call successors, (10725) [2021-12-06 23:57:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60264 states to 60264 states and 90643 transitions. [2021-12-06 23:57:43,990 INFO L78 Accepts]: Start accepts. Automaton has 60264 states and 90643 transitions. Word has length 163 [2021-12-06 23:57:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:43,990 INFO L470 AbstractCegarLoop]: Abstraction has 60264 states and 90643 transitions. [2021-12-06 23:57:43,990 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 23:57:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 60264 states and 90643 transitions. [2021-12-06 23:57:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-06 23:57:44,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:44,064 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, 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, 1, 1, 1, 1] [2021-12-06 23:57:44,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 23:57:44,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:44,266 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 394719976, now seen corresponding path program 1 times [2021-12-06 23:57:44,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:44,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397880002] [2021-12-06 23:57:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:44,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:57:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:57:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 23:57:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:57:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-06 23:57:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-06 23:57:44,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:44,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397880002] [2021-12-06 23:57:44,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397880002] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:57:44,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535791928] [2021-12-06 23:57:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:44,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:44,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:57:44,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:57:44,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 23:57:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:44,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:57:44,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:57:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:57:44,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:57:44,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535791928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:44,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:57:44,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 23:57:44,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528762636] [2021-12-06 23:57:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:44,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:57:44,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:57:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:57:44,622 INFO L87 Difference]: Start difference. First operand 60264 states and 90643 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 23:57:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:57:49,718 INFO L93 Difference]: Finished difference Result 171137 states and 262196 transitions. [2021-12-06 23:57:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:57:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 167 [2021-12-06 23:57:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:57:50,070 INFO L225 Difference]: With dead ends: 171137 [2021-12-06 23:57:50,070 INFO L226 Difference]: Without dead ends: 114855 [2021-12-06 23:57:50,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 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 23:57:50,170 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 282 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 599 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 23:57:50,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 599 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:57:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114855 states. [2021-12-06 23:57:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114855 to 113935. [2021-12-06 23:57:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113935 states, 97933 states have (on average 1.4540961677881816) internal successors, (142404), 99277 states have internal predecessors, (142404), 9250 states have call successors, (9250), 5748 states have call predecessors, (9250), 6750 states have return successors, (20378), 8974 states have call predecessors, (20378), 9246 states have call successors, (20378) [2021-12-06 23:57:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113935 states to 113935 states and 172032 transitions. [2021-12-06 23:57:55,734 INFO L78 Accepts]: Start accepts. Automaton has 113935 states and 172032 transitions. Word has length 167 [2021-12-06 23:57:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:57:55,734 INFO L470 AbstractCegarLoop]: Abstraction has 113935 states and 172032 transitions. [2021-12-06 23:57:55,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 23:57:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 113935 states and 172032 transitions. [2021-12-06 23:57:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-06 23:57:55,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:57:55,891 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, 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, 1, 1, 1, 1] [2021-12-06 23:57:55,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 23:57:56,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:56,093 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:57:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:57:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 364628884, now seen corresponding path program 1 times [2021-12-06 23:57:56,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:57:56,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927871291] [2021-12-06 23:57:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:56,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:57:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:57:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:57:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:57:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:57:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:57:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:57:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:57:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 23:57:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:57:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-06 23:57:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-06 23:57:56,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:57:56,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927871291] [2021-12-06 23:57:56,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927871291] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:57:56,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175253455] [2021-12-06 23:57:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:57:56,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:57:56,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:57:56,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:57:56,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 23:57:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:57:56,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:57:56,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:57:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:57:56,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:57:56,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175253455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:57:56,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:57:56,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 23:57:56,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501693249] [2021-12-06 23:57:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:57:56,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:57:56,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:57:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:57:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:57:56,424 INFO L87 Difference]: Start difference. First operand 113935 states and 172032 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 23:58:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:58:03,266 INFO L93 Difference]: Finished difference Result 227568 states and 345932 transitions. [2021-12-06 23:58:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:58:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 167 [2021-12-06 23:58:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:58:03,804 INFO L225 Difference]: With dead ends: 227568 [2021-12-06 23:58:03,805 INFO L226 Difference]: Without dead ends: 162216 [2021-12-06 23:58:03,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 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 23:58:03,932 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 283 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 604 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 23:58:03,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 604 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:58:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162216 states. [2021-12-06 23:58:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162216 to 160900. [2021-12-06 23:58:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160900 states, 138636 states have (on average 1.4573631668542082) internal successors, (202043), 140496 states have internal predecessors, (202043), 12825 states have call successors, (12825), 8051 states have call predecessors, (12825), 9437 states have return successors, (27612), 12417 states have call predecessors, (27612), 12821 states have call successors, (27612) [2021-12-06 23:58:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160900 states to 160900 states and 242480 transitions. [2021-12-06 23:58:12,153 INFO L78 Accepts]: Start accepts. Automaton has 160900 states and 242480 transitions. Word has length 167 [2021-12-06 23:58:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:58:12,153 INFO L470 AbstractCegarLoop]: Abstraction has 160900 states and 242480 transitions. [2021-12-06 23:58:12,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 23:58:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 160900 states and 242480 transitions. [2021-12-06 23:58:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-06 23:58:12,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:58:12,377 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, 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] [2021-12-06 23:58:12,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 23:58:12,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 23:58:12,579 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:58:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:58:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1534367303, now seen corresponding path program 1 times [2021-12-06 23:58:12,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:58:12,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201374535] [2021-12-06 23:58:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:12,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:58:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:58:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:58:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:58:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:58:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:58:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:58:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:58:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:58:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-06 23:58:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:58:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:58:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:58:12,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:58:12,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201374535] [2021-12-06 23:58:12,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201374535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:58:12,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758231166] [2021-12-06 23:58:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:12,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:58:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:58:12,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:58:12,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 23:58:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:12,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:58:12,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:58:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 23:58:13,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:58:13,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758231166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:58:13,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:58:13,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:58:13,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994162726] [2021-12-06 23:58:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:58:13,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:58:13,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:58:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:58:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:58:13,053 INFO L87 Difference]: Start difference. First operand 160900 states and 242480 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 23:58:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:58:18,874 INFO L93 Difference]: Finished difference Result 237663 states and 357732 transitions. [2021-12-06 23:58:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:58:18,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 185 [2021-12-06 23:58:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:58:19,135 INFO L225 Difference]: With dead ends: 237663 [2021-12-06 23:58:19,136 INFO L226 Difference]: Without dead ends: 102430 [2021-12-06 23:58:19,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 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 23:58:19,367 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 304 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 419 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 23:58:19,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 419 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:58:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102430 states. [2021-12-06 23:58:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102430 to 94642. [2021-12-06 23:58:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94642 states, 81772 states have (on average 1.397703370346818) internal successors, (114293), 82660 states have internal predecessors, (114293), 7221 states have call successors, (7221), 4905 states have call predecessors, (7221), 5647 states have return successors, (12549), 7109 states have call predecessors, (12549), 7217 states have call successors, (12549) [2021-12-06 23:58:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94642 states to 94642 states and 134063 transitions. [2021-12-06 23:58:24,446 INFO L78 Accepts]: Start accepts. Automaton has 94642 states and 134063 transitions. Word has length 185 [2021-12-06 23:58:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:58:24,447 INFO L470 AbstractCegarLoop]: Abstraction has 94642 states and 134063 transitions. [2021-12-06 23:58:24,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 23:58:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 94642 states and 134063 transitions. [2021-12-06 23:58:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-06 23:58:24,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:58:24,559 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, 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] [2021-12-06 23:58:24,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 23:58:24,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 23:58:24,761 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:58:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:58:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 401388635, now seen corresponding path program 1 times [2021-12-06 23:58:24,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:58:24,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782867088] [2021-12-06 23:58:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:24,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:58:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:58:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:58:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:58:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:58:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:58:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:58:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:58:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:58:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 23:58:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:58:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:58:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:58:24,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:58:24,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782867088] [2021-12-06 23:58:24,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782867088] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:58:24,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460742491] [2021-12-06 23:58:24,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:24,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:58:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:58:24,865 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:58:24,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 23:58:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:25,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:58:25,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:58:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 23:58:25,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:58:25,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460742491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:58:25,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:58:25,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:58:25,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416034538] [2021-12-06 23:58:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:58:25,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:58:25,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:58:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:58:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:58:25,192 INFO L87 Difference]: Start difference. First operand 94642 states and 134063 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 23:58:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:58:29,589 INFO L93 Difference]: Finished difference Result 160302 states and 229919 transitions. [2021-12-06 23:58:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:58:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 185 [2021-12-06 23:58:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:58:29,778 INFO L225 Difference]: With dead ends: 160302 [2021-12-06 23:58:29,778 INFO L226 Difference]: Without dead ends: 80535 [2021-12-06 23:58:29,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 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 23:58:29,898 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 320 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 414 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 23:58:29,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 414 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:58:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80535 states. [2021-12-06 23:58:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80535 to 57885. [2021-12-06 23:58:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57885 states, 50006 states have (on average 1.346698396192457) internal successors, (67343), 50482 states have internal predecessors, (67343), 4338 states have call successors, (4338), 3117 states have call predecessors, (4338), 3539 states have return successors, (6488), 4302 states have call predecessors, (6488), 4334 states have call successors, (6488) [2021-12-06 23:58:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57885 states to 57885 states and 78169 transitions. [2021-12-06 23:58:34,057 INFO L78 Accepts]: Start accepts. Automaton has 57885 states and 78169 transitions. Word has length 185 [2021-12-06 23:58:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:58:34,058 INFO L470 AbstractCegarLoop]: Abstraction has 57885 states and 78169 transitions. [2021-12-06 23:58:34,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 23:58:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 57885 states and 78169 transitions. [2021-12-06 23:58:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-06 23:58:34,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:58:34,111 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, 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] [2021-12-06 23:58:34,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 23:58:34,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 23:58:34,313 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:58:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:58:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 837868665, now seen corresponding path program 1 times [2021-12-06 23:58:34,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:58:34,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883602230] [2021-12-06 23:58:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:34,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:58:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:58:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:58:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:58:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:58:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:58:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:58:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:58:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:58:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 23:58:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:58:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:58:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:58:34,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:58:34,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883602230] [2021-12-06 23:58:34,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883602230] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:58:34,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965688121] [2021-12-06 23:58:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:34,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:58:34,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:58:34,415 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:58:34,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 23:58:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:34,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:58:34,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:58:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-06 23:58:34,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:58:34,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965688121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:58:34,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:58:34,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:58:34,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043918385] [2021-12-06 23:58:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:58:34,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:58:34,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:58:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:58:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:58:34,607 INFO L87 Difference]: Start difference. First operand 57885 states and 78169 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 23:58:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:58:38,514 INFO L93 Difference]: Finished difference Result 116385 states and 157005 transitions. [2021-12-06 23:58:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:58:38,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 185 [2021-12-06 23:58:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:58:38,659 INFO L225 Difference]: With dead ends: 116385 [2021-12-06 23:58:38,659 INFO L226 Difference]: Without dead ends: 62483 [2021-12-06 23:58:38,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 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 23:58:38,747 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 334 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 603 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 23:58:38,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 603 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:58:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62483 states. [2021-12-06 23:58:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62483 to 61241. [2021-12-06 23:58:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61241 states, 53149 states have (on average 1.315866714331408) internal successors, (69937), 53590 states have internal predecessors, (69937), 4342 states have call successors, (4342), 3307 states have call predecessors, (4342), 3748 states have return successors, (6454), 4360 states have call predecessors, (6454), 4338 states have call successors, (6454) [2021-12-06 23:58:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61241 states to 61241 states and 80733 transitions. [2021-12-06 23:58:43,144 INFO L78 Accepts]: Start accepts. Automaton has 61241 states and 80733 transitions. Word has length 185 [2021-12-06 23:58:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:58:43,145 INFO L470 AbstractCegarLoop]: Abstraction has 61241 states and 80733 transitions. [2021-12-06 23:58:43,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 23:58:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 61241 states and 80733 transitions. [2021-12-06 23:58:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-06 23:58:43,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:58:43,198 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 23:58:43,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 23:58:43,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 23:58:43,400 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:58:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:58:43,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1604039887, now seen corresponding path program 1 times [2021-12-06 23:58:43,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:58:43,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481828263] [2021-12-06 23:58:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:43,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:58:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:58:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:58:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:58:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:58:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:58:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:58:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:58:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 23:58:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:58:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 23:58:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:58:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:58:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:58:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 23:58:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 23:58:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 23:58:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:58:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:58:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 23:58:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-06 23:58:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,506 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 23:58:43,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:58:43,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481828263] [2021-12-06 23:58:43,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481828263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:58:43,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061951149] [2021-12-06 23:58:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:43,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:58:43,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:58:43,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:58:43,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 23:58:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:43,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:58:43,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:58:43,716 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 23:58:43,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:58:43,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061951149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:58:43,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:58:43,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 23:58:43,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644141208] [2021-12-06 23:58:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:58:43,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:58:43,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:58:43,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:58:43,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:58:43,718 INFO L87 Difference]: Start difference. First operand 61241 states and 80733 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 23:58:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:58:47,475 INFO L93 Difference]: Finished difference Result 69161 states and 90341 transitions. [2021-12-06 23:58:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:58:47,476 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 23:58:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:58:47,606 INFO L225 Difference]: With dead ends: 69161 [2021-12-06 23:58:47,606 INFO L226 Difference]: Without dead ends: 65201 [2021-12-06 23:58:47,631 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 23:58:47,631 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 52 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 741 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 23:58:47,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 741 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:58:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65201 states. [2021-12-06 23:58:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65201 to 65191. [2021-12-06 23:58:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65191 states, 56227 states have (on average 1.3096555035836877) internal successors, (73638), 56715 states have internal predecessors, (73638), 4784 states have call successors, (4784), 3629 states have call predecessors, (4784), 4178 states have return successors, (7061), 4863 states have call predecessors, (7061), 4780 states have call successors, (7061) [2021-12-06 23:58:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65191 states to 65191 states and 85483 transitions. [2021-12-06 23:58:51,955 INFO L78 Accepts]: Start accepts. Automaton has 65191 states and 85483 transitions. Word has length 195 [2021-12-06 23:58:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:58:51,956 INFO L470 AbstractCegarLoop]: Abstraction has 65191 states and 85483 transitions. [2021-12-06 23:58:51,956 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 23:58:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 65191 states and 85483 transitions. [2021-12-06 23:58:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-06 23:58:52,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:58:52,009 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 23:58:52,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 23:58:52,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 23:58:52,211 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:58:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:58:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1793534131, now seen corresponding path program 1 times [2021-12-06 23:58:52,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:58:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793999224] [2021-12-06 23:58:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:52,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:58:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:58:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:58:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:58:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:58:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 23:58:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 23:58:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 23:58:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 23:58:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:58:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 23:58:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:58:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:58:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:58:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 23:58:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 23:58:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 23:58:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:58:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:58:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 23:58:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-06 23:58:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,301 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 23:58:52,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:58:52,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793999224] [2021-12-06 23:58:52,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793999224] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:58:52,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138777509] [2021-12-06 23:58:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:58:52,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:58:52,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:58:52,302 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:58:52,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 23:58:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:58:52,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:58:52,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:58:52,539 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 23:58:52,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:58:52,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138777509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:58:52,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:58:52,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 23:58:52,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220087597] [2021-12-06 23:58:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:58:52,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:58:52,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:58:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:58:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:58:52,540 INFO L87 Difference]: Start difference. First operand 65191 states and 85483 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 23:58:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:58:56,350 INFO L93 Difference]: Finished difference Result 71697 states and 93675 transitions. [2021-12-06 23:58:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:58:56,350 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 23:58:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:58:56,472 INFO L225 Difference]: With dead ends: 71697 [2021-12-06 23:58:56,473 INFO L226 Difference]: Without dead ends: 57272 [2021-12-06 23:58:56,510 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 23:58:56,511 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 359 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 23:58:56,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 359 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:58:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57272 states. [2021-12-06 23:59:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57272 to 57272. [2021-12-06 23:59:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57272 states, 50059 states have (on average 1.3220000399528555) internal successors, (66178), 50450 states have internal predecessors, (66178), 3894 states have call successors, (3894), 2984 states have call predecessors, (3894), 3318 states have return successors, (5843), 3853 states have call predecessors, (5843), 3892 states have call successors, (5843) [2021-12-06 23:59:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57272 states to 57272 states and 75915 transitions. [2021-12-06 23:59:00,424 INFO L78 Accepts]: Start accepts. Automaton has 57272 states and 75915 transitions. Word has length 195 [2021-12-06 23:59:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:59:00,425 INFO L470 AbstractCegarLoop]: Abstraction has 57272 states and 75915 transitions. [2021-12-06 23:59:00,425 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 23:59:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 57272 states and 75915 transitions. [2021-12-06 23:59:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-06 23:59:00,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:59:00,477 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, 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, 1, 1, 1, 1, 1] [2021-12-06 23:59:00,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 23:59:00,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:59:00,678 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:59:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:59:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash 158369743, now seen corresponding path program 1 times [2021-12-06 23:59:00,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:59:00,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053827644] [2021-12-06 23:59:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:59:00,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:59:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:59:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:59:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:59:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:59:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:59:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:59:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:59:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 23:59:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 23:59:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:59:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 23:59:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:59:00,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:59:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053827644] [2021-12-06 23:59:00,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053827644] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:59:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124221674] [2021-12-06 23:59:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:59:00,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:59:00,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:59:00,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:59:00,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 23:59:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:00,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:59:00,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:59:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:59:00,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:59:00,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124221674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:59:00,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:59:00,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:59:00,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397378745] [2021-12-06 23:59:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:59:00,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:59:00,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:59:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:59:00,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:59:00,965 INFO L87 Difference]: Start difference. First operand 57272 states and 75915 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 23:59:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:59:07,730 INFO L93 Difference]: Finished difference Result 163435 states and 218782 transitions. [2021-12-06 23:59:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:59:07,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 186 [2021-12-06 23:59:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:59:07,998 INFO L225 Difference]: With dead ends: 163435 [2021-12-06 23:59:07,998 INFO L226 Difference]: Without dead ends: 106177 [2021-12-06 23:59:08,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 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 23:59:08,087 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 187 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 645 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 23:59:08,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 645 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:59:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106177 states. [2021-12-06 23:59:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106177 to 106173. [2021-12-06 23:59:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106173 states, 92487 states have (on average 1.3196665477310325) internal successors, (122052), 93268 states have internal predecessors, (122052), 7417 states have call successors, (7417), 5599 states have call predecessors, (7417), 6268 states have return successors, (12758), 7337 states have call predecessors, (12758), 7415 states have call successors, (12758) [2021-12-06 23:59:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106173 states to 106173 states and 142227 transitions. [2021-12-06 23:59:15,492 INFO L78 Accepts]: Start accepts. Automaton has 106173 states and 142227 transitions. Word has length 186 [2021-12-06 23:59:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:59:15,492 INFO L470 AbstractCegarLoop]: Abstraction has 106173 states and 142227 transitions. [2021-12-06 23:59:15,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 23:59:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 106173 states and 142227 transitions. [2021-12-06 23:59:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-06 23:59:15,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:59:15,583 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, 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] [2021-12-06 23:59:15,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-06 23:59:15,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-06 23:59:15,785 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:59:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:59:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 355981213, now seen corresponding path program 1 times [2021-12-06 23:59:15,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:59:15,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646726957] [2021-12-06 23:59:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:59:15,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:59:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:59:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:59:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:59:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:59:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:59:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 23:59:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 23:59:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:59:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 23:59:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:59:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 23:59:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-12-06 23:59:15,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:59:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646726957] [2021-12-06 23:59:15,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646726957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:59:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025966488] [2021-12-06 23:59:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:59:15,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:59:15,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:59:15,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:59:15,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 23:59:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:15,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:59:15,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:59:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-06 23:59:16,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:59:16,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025966488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:59:16,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:59:16,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:59:16,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421620536] [2021-12-06 23:59:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:59:16,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:59:16,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:59:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:59:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:59:16,065 INFO L87 Difference]: Start difference. First operand 106173 states and 142227 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 23:59:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:59:29,398 INFO L93 Difference]: Finished difference Result 314885 states and 426430 transitions. [2021-12-06 23:59:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:59:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 186 [2021-12-06 23:59:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:59:29,972 INFO L225 Difference]: With dead ends: 314885 [2021-12-06 23:59:29,972 INFO L226 Difference]: Without dead ends: 208730 [2021-12-06 23:59:30,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 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 23:59:30,278 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 182 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 497 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 23:59:30,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 497 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:59:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208730 states. [2021-12-06 23:59:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208730 to 207040. [2021-12-06 23:59:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207040 states, 180676 states have (on average 1.311790165821692) internal successors, (237009), 182237 states have internal predecessors, (237009), 14187 states have call successors, (14187), 10875 states have call predecessors, (14187), 12176 states have return successors, (29795), 13991 states have call predecessors, (29795), 14185 states have call successors, (29795) [2021-12-06 23:59:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207040 states to 207040 states and 280991 transitions. [2021-12-06 23:59:45,246 INFO L78 Accepts]: Start accepts. Automaton has 207040 states and 280991 transitions. Word has length 186 [2021-12-06 23:59:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:59:45,247 INFO L470 AbstractCegarLoop]: Abstraction has 207040 states and 280991 transitions. [2021-12-06 23:59:45,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 23:59:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 207040 states and 280991 transitions. [2021-12-06 23:59:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-06 23:59:45,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:59:45,554 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, 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] [2021-12-06 23:59:45,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 23:59:45,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:59:45,756 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:59:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:59:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1045374053, now seen corresponding path program 1 times [2021-12-06 23:59:45,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:59:45,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214677633] [2021-12-06 23:59:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:59:45,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:59:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:59:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:59:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:59:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:59:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:59:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 23:59:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 23:59:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:59:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 23:59:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:59:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 23:59:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:59:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-12-06 23:59:45,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:59:45,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214677633] [2021-12-06 23:59:45,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214677633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:59:45,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:59:45,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:59:45,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273407663] [2021-12-06 23:59:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:59:45,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:59:45,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:59:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:59:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:59:45,813 INFO L87 Difference]: Start difference. First operand 207040 states and 280991 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 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-07 00:00:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:00:00,256 INFO L93 Difference]: Finished difference Result 405721 states and 547899 transitions. [2021-12-07 00:00:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:00:00,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 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 186 [2021-12-07 00:00:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:00:00,845 INFO L225 Difference]: With dead ends: 405721 [2021-12-07 00:00:00,845 INFO L226 Difference]: Without dead ends: 198697 [2021-12-07 00:00:01,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:00:01,104 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 394 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:00:01,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 406 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:00:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198697 states. [2021-12-07 00:00:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198697 to 179738. [2021-12-07 00:00:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179738 states, 157266 states have (on average 1.3092213192934263) internal successors, (205896), 159934 states have internal predecessors, (205896), 10793 states have call successors, (10793), 8231 states have call predecessors, (10793), 11678 states have return successors, (25232), 11604 states have call predecessors, (25232), 10791 states have call successors, (25232) [2021-12-07 00:00:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179738 states to 179738 states and 241921 transitions. [2021-12-07 00:00:15,163 INFO L78 Accepts]: Start accepts. Automaton has 179738 states and 241921 transitions. Word has length 186 [2021-12-07 00:00:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:00:15,163 INFO L470 AbstractCegarLoop]: Abstraction has 179738 states and 241921 transitions. [2021-12-07 00:00:15,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 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-07 00:00:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 179738 states and 241921 transitions. [2021-12-07 00:00:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-12-07 00:00:15,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:00:15,319 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, 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] [2021-12-07 00:00:15,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-07 00:00:15,319 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:00:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:00:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1213588627, now seen corresponding path program 1 times [2021-12-07 00:00:15,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:00:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696306643] [2021-12-07 00:00:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:00:15,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:00:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:00:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:00:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:00:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:00:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:00:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-07 00:00:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:00:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:00:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-07 00:00:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:00:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-07 00:00:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-07 00:00:15,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:00:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696306643] [2021-12-07 00:00:15,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696306643] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:00:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373739576] [2021-12-07 00:00:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:00:15,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:00:15,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:00:15,395 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:00:15,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-07 00:00:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:15,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:00:15,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:00:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-07 00:00:15,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:00:15,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373739576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:00:15,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:00:15,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:00:15,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448699859] [2021-12-07 00:00:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:00:15,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:00:15,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:00:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:00:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:00:15,572 INFO L87 Difference]: Start difference. First operand 179738 states and 241921 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-07 00:00:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:00:34,469 INFO L93 Difference]: Finished difference Result 439572 states and 597361 transitions. [2021-12-07 00:00:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:00:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 188 [2021-12-07 00:00:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:00:35,303 INFO L225 Difference]: With dead ends: 439572 [2021-12-07 00:00:35,303 INFO L226 Difference]: Without dead ends: 259852 [2021-12-07 00:00:35,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 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-07 00:00:35,544 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 189 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 452 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-07 00:00:35,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 452 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:00:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259852 states. [2021-12-07 00:00:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259852 to 253212. [2021-12-07 00:00:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253212 states, 221148 states have (on average 1.3084902418290014) internal successors, (289370), 224953 states have internal predecessors, (289370), 15541 states have call successors, (15541), 11729 states have call predecessors, (15541), 16522 states have return successors, (39920), 16561 states have call predecessors, (39920), 15539 states have call successors, (39920) [2021-12-07 00:00:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253212 states to 253212 states and 344831 transitions. [2021-12-07 00:00:54,865 INFO L78 Accepts]: Start accepts. Automaton has 253212 states and 344831 transitions. Word has length 188 [2021-12-07 00:00:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:00:54,865 INFO L470 AbstractCegarLoop]: Abstraction has 253212 states and 344831 transitions. [2021-12-07 00:00:54,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-07 00:00:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 253212 states and 344831 transitions. [2021-12-07 00:00:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-07 00:00:55,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:00:55,122 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, 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, 1, 1, 1] [2021-12-07 00:00:55,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-07 00:00:55,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:00:55,323 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:00:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:00:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2071212901, now seen corresponding path program 1 times [2021-12-07 00:00:55,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:00:55,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871714731] [2021-12-07 00:00:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:00:55,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:00:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:00:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:00:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:00:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:00:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:00:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:00:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:00:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:00:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-07 00:00:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:00:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-07 00:00:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-07 00:00:55,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:00:55,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871714731] [2021-12-07 00:00:55,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871714731] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:00:55,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169096179] [2021-12-07 00:00:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:00:55,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:00:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:00:55,428 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:00:55,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-07 00:00:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:00:55,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:00:55,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:00:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-07 00:00:55,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:00:55,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169096179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:00:55,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:00:55,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:00:55,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267334707] [2021-12-07 00:00:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:00:55,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:00:55,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:00:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:00:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:00:55,636 INFO L87 Difference]: Start difference. First operand 253212 states and 344831 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-07 00:01:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:14,445 INFO L93 Difference]: Finished difference Result 435758 states and 613651 transitions. [2021-12-07 00:01:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 190 [2021-12-07 00:01:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:15,405 INFO L225 Difference]: With dead ends: 435758 [2021-12-07 00:01:15,406 INFO L226 Difference]: Without dead ends: 253416 [2021-12-07 00:01:15,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 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-07 00:01:15,779 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 171 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 574 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-07 00:01:15,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 574 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253416 states. [2021-12-07 00:01:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253416 to 252924. [2021-12-07 00:01:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252924 states, 220860 states have (on average 1.2868423435660599) internal successors, (284212), 224665 states have internal predecessors, (284212), 15541 states have call successors, (15541), 11729 states have call predecessors, (15541), 16522 states have return successors, (39920), 16561 states have call predecessors, (39920), 15539 states have call successors, (39920) [2021-12-07 00:01:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252924 states to 252924 states and 339673 transitions. [2021-12-07 00:01:35,799 INFO L78 Accepts]: Start accepts. Automaton has 252924 states and 339673 transitions. Word has length 190 [2021-12-07 00:01:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:35,799 INFO L470 AbstractCegarLoop]: Abstraction has 252924 states and 339673 transitions. [2021-12-07 00:01:35,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-07 00:01:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 252924 states and 339673 transitions. [2021-12-07 00:01:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:01:36,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:36,140 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, 3, 3, 3, 3, 3, 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-07 00:01:36,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-07 00:01:36,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-07 00:01:36,341 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 939803217, now seen corresponding path program 1 times [2021-12-07 00:01:36,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:36,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089703487] [2021-12-07 00:01:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:36,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:01:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:01:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:01:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:01:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:01:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:01:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:01:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:01:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:01:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:01:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:01:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-07 00:01:36,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089703487] [2021-12-07 00:01:36,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089703487] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:01:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755273939] [2021-12-07 00:01:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:36,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:01:36,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:01:36,438 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:01:36,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-07 00:01:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:36,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:01:36,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:01:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-07 00:01:36,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:01:36,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755273939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:36,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:01:36,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-07 00:01:36,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021563122] [2021-12-07 00:01:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:36,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:01:36,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:01:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:01:36,672 INFO L87 Difference]: Start difference. First operand 252924 states and 339673 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:01:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:48,182 INFO L93 Difference]: Finished difference Result 290850 states and 392020 transitions. [2021-12-07 00:01:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:01:48,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-07 00:01:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:48,556 INFO L225 Difference]: With dead ends: 290850 [2021-12-07 00:01:48,556 INFO L226 Difference]: Without dead ends: 148474 [2021-12-07 00:01:48,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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-07 00:01:48,750 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 244 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:48,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 446 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:01:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148474 states. [2021-12-07 00:02:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148474 to 148138. [2021-12-07 00:02:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148138 states, 129358 states have (on average 1.2699717064271248) internal successors, (164281), 131477 states have internal predecessors, (164281), 9165 states have call successors, (9165), 6901 states have call predecessors, (9165), 9614 states have return successors, (22461), 9775 states have call predecessors, (22461), 9163 states have call successors, (22461) [2021-12-07 00:02:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148138 states to 148138 states and 195907 transitions. [2021-12-07 00:02:00,728 INFO L78 Accepts]: Start accepts. Automaton has 148138 states and 195907 transitions. Word has length 192 [2021-12-07 00:02:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:02:00,729 INFO L470 AbstractCegarLoop]: Abstraction has 148138 states and 195907 transitions. [2021-12-07 00:02:00,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 148138 states and 195907 transitions. [2021-12-07 00:02:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:02:00,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:02:00,836 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, 3, 3, 3, 3, 3, 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-07 00:02:00,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-07 00:02:01,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-07 00:02:01,038 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:02:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:02:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash -848066605, now seen corresponding path program 1 times [2021-12-07 00:02:01,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:02:01,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836180626] [2021-12-07 00:02:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:01,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:02:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:02:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:02:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:02:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:02:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:02:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:02:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:02:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:02:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:02:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-07 00:02:01,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:02:01,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836180626] [2021-12-07 00:02:01,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836180626] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:02:01,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520804925] [2021-12-07 00:02:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:01,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:02:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:02:01,110 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:02:01,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-07 00:02:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:01,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:02:01,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:02:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-07 00:02:01,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:02:01,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520804925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:02:01,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:02:01,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-07 00:02:01,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656507354] [2021-12-07 00:02:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:02:01,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:02:01,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:02:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:02:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:02:01,343 INFO L87 Difference]: Start difference. First operand 148138 states and 195907 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:02:12,885 INFO L93 Difference]: Finished difference Result 274824 states and 373403 transitions. [2021-12-07 00:02:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:02:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-07 00:02:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:02:13,219 INFO L225 Difference]: With dead ends: 274824 [2021-12-07 00:02:13,219 INFO L226 Difference]: Without dead ends: 135628 [2021-12-07 00:02:13,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 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-07 00:02:13,430 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 286 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:02:13,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 473 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:02:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135628 states. [2021-12-07 00:02:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135628 to 126974. [2021-12-07 00:02:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126974 states, 111010 states have (on average 1.242833978920818) internal successors, (137967), 112805 states have internal predecessors, (137967), 7757 states have call successors, (7757), 5877 states have call predecessors, (7757), 8206 states have return successors, (19373), 8299 states have call predecessors, (19373), 7755 states have call successors, (19373) [2021-12-07 00:02:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126974 states to 126974 states and 165097 transitions. [2021-12-07 00:02:24,285 INFO L78 Accepts]: Start accepts. Automaton has 126974 states and 165097 transitions. Word has length 192 [2021-12-07 00:02:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:02:24,285 INFO L470 AbstractCegarLoop]: Abstraction has 126974 states and 165097 transitions. [2021-12-07 00:02:24,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 126974 states and 165097 transitions. [2021-12-07 00:02:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:02:24,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:02:24,348 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, 3, 3, 3, 3, 3, 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-07 00:02:24,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-07 00:02:24,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-07 00:02:24,550 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:02:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:02:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash 550886997, now seen corresponding path program 1 times [2021-12-07 00:02:24,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:02:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998117805] [2021-12-07 00:02:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:24,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:02:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:02:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:02:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:02:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:02:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:02:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:02:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:02:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:02:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:02:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-07 00:02:24,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:02:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998117805] [2021-12-07 00:02:24,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998117805] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:02:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456517096] [2021-12-07 00:02:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:24,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:02:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:02:24,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:02:24,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-07 00:02:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:24,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:02:24,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:02:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-07 00:02:24,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:02:24,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456517096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:02:24,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:02:24,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-07 00:02:24,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29714775] [2021-12-07 00:02:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:02:24,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:02:24,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:02:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:02:24,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:02:24,874 INFO L87 Difference]: Start difference. First operand 126974 states and 165097 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:02:31,625 INFO L93 Difference]: Finished difference Result 164564 states and 215244 transitions. [2021-12-07 00:02:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:02:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-07 00:02:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:02:31,805 INFO L225 Difference]: With dead ends: 164564 [2021-12-07 00:02:31,805 INFO L226 Difference]: Without dead ends: 81670 [2021-12-07 00:02:31,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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-07 00:02:31,902 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 233 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:02:31,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 432 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:02:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81670 states. [2021-12-07 00:02:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81670 to 81670. [2021-12-07 00:02:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81670 states, 71472 states have (on average 1.2281033131855832) internal successors, (87775), 72533 states have internal predecessors, (87775), 5017 states have call successors, (5017), 3773 states have call predecessors, (5017), 5180 states have return successors, (12299), 5367 states have call predecessors, (12299), 5015 states have call successors, (12299) [2021-12-07 00:02:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81670 states to 81670 states and 105091 transitions. [2021-12-07 00:02:38,743 INFO L78 Accepts]: Start accepts. Automaton has 81670 states and 105091 transitions. Word has length 192 [2021-12-07 00:02:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:02:38,744 INFO L470 AbstractCegarLoop]: Abstraction has 81670 states and 105091 transitions. [2021-12-07 00:02:38,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 81670 states and 105091 transitions. [2021-12-07 00:02:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:02:38,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:02:38,776 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, 3, 3, 3, 3, 3, 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-07 00:02:38,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-07 00:02:38,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-07 00:02:38,977 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:02:38,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:02:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1584996205, now seen corresponding path program 1 times [2021-12-07 00:02:38,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:02:38,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807295743] [2021-12-07 00:02:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:38,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:02:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:02:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:02:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:02:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:02:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:02:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:02:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:02:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:02:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:02:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-07 00:02:39,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:02:39,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807295743] [2021-12-07 00:02:39,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807295743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:02:39,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127525076] [2021-12-07 00:02:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:39,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:02:39,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:02:39,078 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:02:39,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-07 00:02:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:39,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:02:39,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:02:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-07 00:02:39,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:02:39,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127525076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:02:39,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:02:39,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-07 00:02:39,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508726160] [2021-12-07 00:02:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:02:39,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:02:39,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:02:39,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:02:39,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:02:39,285 INFO L87 Difference]: Start difference. First operand 81670 states and 105091 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:02:47,646 INFO L93 Difference]: Finished difference Result 174482 states and 230452 transitions. [2021-12-07 00:02:47,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:02:47,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-07 00:02:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:02:47,862 INFO L225 Difference]: With dead ends: 174482 [2021-12-07 00:02:47,862 INFO L226 Difference]: Without dead ends: 92826 [2021-12-07 00:02:48,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 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-07 00:02:48,056 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 270 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:02:48,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 443 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:02:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92826 states. [2021-12-07 00:02:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92826 to 80870. [2021-12-07 00:02:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80870 states, 71276 states have (on average 1.193375049104888) internal successors, (85059), 72361 states have internal predecessors, (85059), 4589 states have call successors, (4589), 3597 states have call predecessors, (4589), 5004 states have return successors, (10268), 4915 states have call predecessors, (10268), 4587 states have call successors, (10268) [2021-12-07 00:02:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80870 states to 80870 states and 99916 transitions. [2021-12-07 00:02:55,465 INFO L78 Accepts]: Start accepts. Automaton has 80870 states and 99916 transitions. Word has length 192 [2021-12-07 00:02:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:02:55,465 INFO L470 AbstractCegarLoop]: Abstraction has 80870 states and 99916 transitions. [2021-12-07 00:02:55,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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-07 00:02:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 80870 states and 99916 transitions. [2021-12-07 00:02:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:02:55,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:02:55,499 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, 3, 3, 3, 3, 3, 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-07 00:02:55,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-07 00:02:55,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:02:55,700 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:02:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:02:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1092530641, now seen corresponding path program 1 times [2021-12-07 00:02:55,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:02:55,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22753766] [2021-12-07 00:02:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:55,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:02:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:02:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:02:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:02:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:02:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:02:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:02:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:02:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:02:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:02:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:02:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-07 00:02:55,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:02:55,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22753766] [2021-12-07 00:02:55,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22753766] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:02:55,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471241632] [2021-12-07 00:02:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:02:55,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:02:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:02:55,774 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:02:55,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-07 00:02:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:02:55,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:02:55,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:02:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-12-07 00:02:56,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:02:56,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471241632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:02:56,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:02:56,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-07 00:02:56,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804712664] [2021-12-07 00:02:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:02:56,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:02:56,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:02:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:02:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:02:56,039 INFO L87 Difference]: Start difference. First operand 80870 states and 99916 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-07 00:03:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:03,337 INFO L93 Difference]: Finished difference Result 162130 states and 204095 transitions. [2021-12-07 00:03:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:03:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 192 [2021-12-07 00:03:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:03,516 INFO L225 Difference]: With dead ends: 162130 [2021-12-07 00:03:03,517 INFO L226 Difference]: Without dead ends: 81276 [2021-12-07 00:03:03,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 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-07 00:03:03,626 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 88 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 889 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-07 00:03:03,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 889 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:03:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81276 states. [2021-12-07 00:03:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81276 to 77290. [2021-12-07 00:03:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77290 states, 67762 states have (on average 1.1736814143620318) internal successors, (79531), 68825 states have internal predecessors, (79531), 4589 states have call successors, (4589), 3597 states have call predecessors, (4589), 4938 states have return successors, (9534), 4871 states have call predecessors, (9534), 4587 states have call successors, (9534) [2021-12-07 00:03:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77290 states to 77290 states and 93654 transitions. [2021-12-07 00:03:11,201 INFO L78 Accepts]: Start accepts. Automaton has 77290 states and 93654 transitions. Word has length 192 [2021-12-07 00:03:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:11,202 INFO L470 AbstractCegarLoop]: Abstraction has 77290 states and 93654 transitions. [2021-12-07 00:03:11,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-07 00:03:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 77290 states and 93654 transitions. [2021-12-07 00:03:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:03:11,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:11,241 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, 3, 3, 3, 3, 3, 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-07 00:03:11,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-07 00:03:11,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-07 00:03:11,443 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -98376309, now seen corresponding path program 1 times [2021-12-07 00:03:11,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:11,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961060998] [2021-12-07 00:03:11,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:11,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:03:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:03:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:03:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:03:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-07 00:03:11,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:11,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961060998] [2021-12-07 00:03:11,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961060998] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:03:11,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151937064] [2021-12-07 00:03:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:11,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:03:11,525 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:03:11,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-07 00:03:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:11,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:03:11,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:03:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-07 00:03:11,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:03:11,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151937064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:11,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:03:11,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-07 00:03:11,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918644498] [2021-12-07 00:03:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:11,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:03:11,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:03:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:03:11,716 INFO L87 Difference]: Start difference. First operand 77290 states and 93654 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-07 00:03:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:18,395 INFO L93 Difference]: Finished difference Result 153504 states and 189129 transitions. [2021-12-07 00:03:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:03:18,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 192 [2021-12-07 00:03:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:18,550 INFO L225 Difference]: With dead ends: 153504 [2021-12-07 00:03:18,550 INFO L226 Difference]: Without dead ends: 76230 [2021-12-07 00:03:18,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 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-07 00:03:18,648 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 49 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 874 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-07 00:03:18,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 874 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:03:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76230 states. [2021-12-07 00:03:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76230 to 75102. [2021-12-07 00:03:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75102 states, 65590 states have (on average 1.1552523250495503) internal successors, (75773), 66647 states have internal predecessors, (75773), 4589 states have call successors, (4589), 3597 states have call predecessors, (4589), 4922 states have return successors, (8583), 4861 states have call predecessors, (8583), 4587 states have call successors, (8583) [2021-12-07 00:03:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75102 states to 75102 states and 88945 transitions. [2021-12-07 00:03:25,362 INFO L78 Accepts]: Start accepts. Automaton has 75102 states and 88945 transitions. Word has length 192 [2021-12-07 00:03:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:25,363 INFO L470 AbstractCegarLoop]: Abstraction has 75102 states and 88945 transitions. [2021-12-07 00:03:25,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-07 00:03:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 75102 states and 88945 transitions. [2021-12-07 00:03:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-07 00:03:25,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:25,391 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, 3, 3, 3, 3, 3, 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-07 00:03:25,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-07 00:03:25,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-12-07 00:03:25,593 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:25,594 INFO L85 PathProgramCache]: Analyzing trace with hash 140438725, now seen corresponding path program 1 times [2021-12-07 00:03:25,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:25,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018685080] [2021-12-07 00:03:25,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:25,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 00:03:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 00:03:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-07 00:03:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-07 00:03:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-07 00:03:25,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:25,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018685080] [2021-12-07 00:03:25,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018685080] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:03:25,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529548842] [2021-12-07 00:03:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:25,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:25,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:03:25,687 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:03:25,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-07 00:03:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:25,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:03:25,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:03:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-07 00:03:25,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:03:25,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529548842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:25,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:03:25,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-07 00:03:25,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521118146] [2021-12-07 00:03:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:25,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:03:25,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:03:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:03:25,865 INFO L87 Difference]: Start difference. First operand 75102 states and 88945 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-07 00:03:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:31,478 INFO L93 Difference]: Finished difference Result 126311 states and 151187 transitions. [2021-12-07 00:03:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:03:31,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 192 [2021-12-07 00:03:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:31,585 INFO L225 Difference]: With dead ends: 126311 [2021-12-07 00:03:31,585 INFO L226 Difference]: Without dead ends: 51222 [2021-12-07 00:03:31,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 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-07 00:03:31,658 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 10 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 859 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-07 00:03:31,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 859 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:03:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51222 states. [2021-12-07 00:03:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51222 to 51022. [2021-12-07 00:03:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51022 states, 44947 states have (on average 1.1414109951720917) internal successors, (51303), 45371 states have internal predecessors, (51303), 3110 states have call successors, (3110), 2449 states have call predecessors, (3110), 2964 states have return successors, (4621), 3203 states have call predecessors, (4621), 3108 states have call successors, (4621) [2021-12-07 00:03:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51022 states to 51022 states and 59034 transitions. [2021-12-07 00:03:36,463 INFO L78 Accepts]: Start accepts. Automaton has 51022 states and 59034 transitions. Word has length 192 [2021-12-07 00:03:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:36,464 INFO L470 AbstractCegarLoop]: Abstraction has 51022 states and 59034 transitions. [2021-12-07 00:03:36,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-07 00:03:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51022 states and 59034 transitions. [2021-12-07 00:03:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-12-07 00:03:36,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:36,487 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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-07 00:03:36,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-07 00:03:36,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:36,689 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1222006696, now seen corresponding path program 1 times [2021-12-07 00:03:36,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:36,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838080673] [2021-12-07 00:03:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:36,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 00:03:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-07 00:03:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-07 00:03:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-07 00:03:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 00:03:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-12-07 00:03:36,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:36,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838080673] [2021-12-07 00:03:36,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838080673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:36,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:03:36,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:03:36,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046691096] [2021-12-07 00:03:36,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:36,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:03:36,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:36,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:03:36,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:03:36,786 INFO L87 Difference]: Start difference. First operand 51022 states and 59034 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-07 00:03:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:41,206 INFO L93 Difference]: Finished difference Result 85330 states and 98790 transitions. [2021-12-07 00:03:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 00:03:41,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 233 [2021-12-07 00:03:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:41,290 INFO L225 Difference]: With dead ends: 85330 [2021-12-07 00:03:41,290 INFO L226 Difference]: Without dead ends: 40718 [2021-12-07 00:03:41,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-07 00:03:41,349 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 1029 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 00:03:41,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 843 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 00:03:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40718 states. [2021-12-07 00:03:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40718 to 39026. [2021-12-07 00:03:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39026 states, 34395 states have (on average 1.1409507195813344) internal successors, (39243), 34725 states have internal predecessors, (39243), 2342 states have call successors, (2342), 1841 states have call predecessors, (2342), 2288 states have return successors, (3581), 2461 states have call predecessors, (3581), 2340 states have call successors, (3581) [2021-12-07 00:03:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39026 states to 39026 states and 45166 transitions. [2021-12-07 00:03:45,190 INFO L78 Accepts]: Start accepts. Automaton has 39026 states and 45166 transitions. Word has length 233 [2021-12-07 00:03:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:45,190 INFO L470 AbstractCegarLoop]: Abstraction has 39026 states and 45166 transitions. [2021-12-07 00:03:45,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-07 00:03:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39026 states and 45166 transitions. [2021-12-07 00:03:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-07 00:03:45,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:45,213 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:03:45,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-07 00:03:45,213 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1539503967, now seen corresponding path program 1 times [2021-12-07 00:03:45,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:45,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187578991] [2021-12-07 00:03:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:45,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 00:03:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-07 00:03:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-07 00:03:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-07 00:03:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-12-07 00:03:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-07 00:03:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-12-07 00:03:45,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:45,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187578991] [2021-12-07 00:03:45,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187578991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:03:45,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042963974] [2021-12-07 00:03:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:45,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:45,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:03:45,283 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:03:45,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-07 00:03:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:45,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:03:45,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:03:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-12-07 00:03:45,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:03:45,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042963974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:45,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:03:45,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:03:45,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559575362] [2021-12-07 00:03:45,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:45,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:03:45,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:45,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:03:45,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:03:45,518 INFO L87 Difference]: Start difference. First operand 39026 states and 45166 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-07 00:03:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:46,725 INFO L93 Difference]: Finished difference Result 48238 states and 55724 transitions. [2021-12-07 00:03:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:03:46,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 276 [2021-12-07 00:03:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:46,740 INFO L225 Difference]: With dead ends: 48238 [2021-12-07 00:03:46,740 INFO L226 Difference]: Without dead ends: 7950 [2021-12-07 00:03:46,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 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-07 00:03:46,779 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 165 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 507 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-07 00:03:46,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 507 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:03:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7950 states. [2021-12-07 00:03:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7950 to 7950. [2021-12-07 00:03:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7950 states, 6950 states have (on average 1.116115107913669) internal successors, (7757), 6991 states have internal predecessors, (7757), 560 states have call successors, (560), 407 states have call predecessors, (560), 439 states have return successors, (622), 553 states have call predecessors, (622), 558 states have call successors, (622) [2021-12-07 00:03:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7950 states to 7950 states and 8939 transitions. [2021-12-07 00:03:47,400 INFO L78 Accepts]: Start accepts. Automaton has 7950 states and 8939 transitions. Word has length 276 [2021-12-07 00:03:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:47,400 INFO L470 AbstractCegarLoop]: Abstraction has 7950 states and 8939 transitions. [2021-12-07 00:03:47,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-07 00:03:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 7950 states and 8939 transitions. [2021-12-07 00:03:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-12-07 00:03:47,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:47,406 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:03:47,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-07 00:03:47,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:47,607 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash -231218712, now seen corresponding path program 1 times [2021-12-07 00:03:47,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:47,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118335236] [2021-12-07 00:03:47,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:47,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-07 00:03:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-07 00:03:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-07 00:03:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-07 00:03:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-07 00:03:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-07 00:03:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 49 proven. 43 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-07 00:03:47,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:47,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118335236] [2021-12-07 00:03:47,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118335236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:03:47,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459609228] [2021-12-07 00:03:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:47,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:03:47,679 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:03:47,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-07 00:03:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:47,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:03:47,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:03:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-07 00:03:47,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:03:47,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459609228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:47,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:03:47,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-07 00:03:47,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149451833] [2021-12-07 00:03:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:47,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:03:47,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:03:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:03:47,940 INFO L87 Difference]: Start difference. First operand 7950 states and 8939 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-07 00:03:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:48,555 INFO L93 Difference]: Finished difference Result 13156 states and 14896 transitions. [2021-12-07 00:03:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:03:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 277 [2021-12-07 00:03:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:48,566 INFO L225 Difference]: With dead ends: 13156 [2021-12-07 00:03:48,567 INFO L226 Difference]: Without dead ends: 7950 [2021-12-07 00:03:48,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 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-07 00:03:48,573 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 159 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 500 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-07 00:03:48,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 500 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:03:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7950 states. [2021-12-07 00:03:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7950 to 7950. [2021-12-07 00:03:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7950 states, 6950 states have (on average 1.1069064748201438) internal successors, (7693), 6991 states have internal predecessors, (7693), 560 states have call successors, (560), 407 states have call predecessors, (560), 439 states have return successors, (622), 553 states have call predecessors, (622), 558 states have call successors, (622) [2021-12-07 00:03:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7950 states to 7950 states and 8875 transitions. [2021-12-07 00:03:49,198 INFO L78 Accepts]: Start accepts. Automaton has 7950 states and 8875 transitions. Word has length 277 [2021-12-07 00:03:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:49,198 INFO L470 AbstractCegarLoop]: Abstraction has 7950 states and 8875 transitions. [2021-12-07 00:03:49,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-07 00:03:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7950 states and 8875 transitions. [2021-12-07 00:03:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2021-12-07 00:03:49,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:49,204 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:03:49,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-07 00:03:49,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-12-07 00:03:49,405 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1157140729, now seen corresponding path program 1 times [2021-12-07 00:03:49,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988174555] [2021-12-07 00:03:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:49,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-07 00:03:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-07 00:03:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 00:03:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-07 00:03:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-07 00:03:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-07 00:03:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 71 proven. 102 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2021-12-07 00:03:49,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:49,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988174555] [2021-12-07 00:03:49,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988174555] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:03:49,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492694369] [2021-12-07 00:03:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:49,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:03:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:03:49,516 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:03:49,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-07 00:03:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:49,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:03:49,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:03:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-07 00:03:49,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:03:49,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492694369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:49,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:03:49,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-07 00:03:49,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580219911] [2021-12-07 00:03:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:49,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:03:49,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:03:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:03:49,761 INFO L87 Difference]: Start difference. First operand 7950 states and 8875 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 00:03:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:50,394 INFO L93 Difference]: Finished difference Result 14258 states and 15990 transitions. [2021-12-07 00:03:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:03:50,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 280 [2021-12-07 00:03:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:50,406 INFO L225 Difference]: With dead ends: 14258 [2021-12-07 00:03:50,406 INFO L226 Difference]: Without dead ends: 7950 [2021-12-07 00:03:50,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 310 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-07 00:03:50,414 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 126 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 458 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-07 00:03:50,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 458 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:03:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7950 states. [2021-12-07 00:03:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7950 to 7950. [2021-12-07 00:03:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7950 states, 6950 states have (on average 1.097410071942446) internal successors, (7627), 6991 states have internal predecessors, (7627), 560 states have call successors, (560), 407 states have call predecessors, (560), 439 states have return successors, (622), 553 states have call predecessors, (622), 558 states have call successors, (622) [2021-12-07 00:03:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7950 states to 7950 states and 8809 transitions. [2021-12-07 00:03:51,045 INFO L78 Accepts]: Start accepts. Automaton has 7950 states and 8809 transitions. Word has length 280 [2021-12-07 00:03:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:51,045 INFO L470 AbstractCegarLoop]: Abstraction has 7950 states and 8809 transitions. [2021-12-07 00:03:51,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 00:03:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7950 states and 8809 transitions. [2021-12-07 00:03:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-12-07 00:03:51,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:51,051 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:03:51,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-07 00:03:51,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-07 00:03:51,252 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -82938401, now seen corresponding path program 1 times [2021-12-07 00:03:51,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422665218] [2021-12-07 00:03:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:51,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-07 00:03:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-07 00:03:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 00:03:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-07 00:03:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-07 00:03:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 00:03:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2021-12-07 00:03:51,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:51,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422665218] [2021-12-07 00:03:51,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422665218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:51,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:03:51,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:03:51,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837571264] [2021-12-07 00:03:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:51,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:03:51,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:51,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:03:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:03:51,399 INFO L87 Difference]: Start difference. First operand 7950 states and 8809 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-07 00:03:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:52,989 INFO L93 Difference]: Finished difference Result 8716 states and 9616 transitions. [2021-12-07 00:03:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 00:03:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 283 [2021-12-07 00:03:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:53,002 INFO L225 Difference]: With dead ends: 8716 [2021-12-07 00:03:53,003 INFO L226 Difference]: Without dead ends: 8713 [2021-12-07 00:03:53,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-12-07 00:03:53,005 INFO L933 BasicCegarLoop]: 491 mSDtfsCounter, 1109 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-07 00:03:53,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 1573 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-07 00:03:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8713 states. [2021-12-07 00:03:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8713 to 8144. [2021-12-07 00:03:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8144 states, 7119 states have (on average 1.0970641944093271) internal successors, (7810), 7160 states have internal predecessors, (7810), 574 states have call successors, (574), 417 states have call predecessors, (574), 450 states have return successors, (638), 568 states have call predecessors, (638), 573 states have call successors, (638) [2021-12-07 00:03:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8144 states to 8144 states and 9022 transitions. [2021-12-07 00:03:53,692 INFO L78 Accepts]: Start accepts. Automaton has 8144 states and 9022 transitions. Word has length 283 [2021-12-07 00:03:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:53,692 INFO L470 AbstractCegarLoop]: Abstraction has 8144 states and 9022 transitions. [2021-12-07 00:03:53,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-07 00:03:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 8144 states and 9022 transitions. [2021-12-07 00:03:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-12-07 00:03:53,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:53,699 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 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-07 00:03:53,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-07 00:03:53,699 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -474097593, now seen corresponding path program 1 times [2021-12-07 00:03:53,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:53,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475622229] [2021-12-07 00:03:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:53,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:03:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:03:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:03:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:03:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:03:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-07 00:03:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-07 00:03:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 00:03:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-07 00:03:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-07 00:03:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:03:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 00:03:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:03:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2021-12-07 00:03:53,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:03:53,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475622229] [2021-12-07 00:03:53,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475622229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:03:53,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:03:53,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:03:53,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487059491] [2021-12-07 00:03:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:03:53,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:03:53,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:03:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:03:53,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:03:53,767 INFO L87 Difference]: Start difference. First operand 8144 states and 9022 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-07 00:03:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:03:54,674 INFO L93 Difference]: Finished difference Result 12147 states and 13610 transitions. [2021-12-07 00:03:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:03:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 287 [2021-12-07 00:03:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:03:54,690 INFO L225 Difference]: With dead ends: 12147 [2021-12-07 00:03:54,690 INFO L226 Difference]: Without dead ends: 9465 [2021-12-07 00:03:54,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-07 00:03:54,695 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 251 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:03:54,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 696 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:03:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9465 states. [2021-12-07 00:03:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9465 to 8148. [2021-12-07 00:03:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8148 states, 7123 states have (on average 1.0970096869296644) internal successors, (7814), 7164 states have internal predecessors, (7814), 574 states have call successors, (574), 417 states have call predecessors, (574), 450 states have return successors, (638), 568 states have call predecessors, (638), 573 states have call successors, (638) [2021-12-07 00:03:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8148 states to 8148 states and 9026 transitions. [2021-12-07 00:03:55,390 INFO L78 Accepts]: Start accepts. Automaton has 8148 states and 9026 transitions. Word has length 287 [2021-12-07 00:03:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:03:55,390 INFO L470 AbstractCegarLoop]: Abstraction has 8148 states and 9026 transitions. [2021-12-07 00:03:55,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-07 00:03:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8148 states and 9026 transitions. [2021-12-07 00:03:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2021-12-07 00:03:55,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:03:55,396 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 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-07 00:03:55,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-07 00:03:55,397 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:03:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:03:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash -583149417, now seen corresponding path program 1 times [2021-12-07 00:03:55,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:03:55,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569456757] [2021-12-07 00:03:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:03:55,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:03:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:03:55,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:03:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:03:55,564 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:03:55,564 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:03:55,565 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-07 00:03:55,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-07 00:03:55,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-12-07 00:03:55,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:03:55,571 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:03:55,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:03:55 BoogieIcfgContainer [2021-12-07 00:03:55,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:03:55,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:03:55,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:03:55,723 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:03:55,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:56:50" (3/4) ... [2021-12-07 00:03:55,724 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 00:03:55,887 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:03:55,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:03:55,887 INFO L158 Benchmark]: Toolchain (without parser) took 426690.69ms. Allocated memory was 136.3MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 113.3MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2021-12-07 00:03:55,887 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 77.6MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:03:55,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.29ms. Allocated memory is still 136.3MB. Free memory was 113.3MB in the beginning and 94.6MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-07 00:03:55,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 136.3MB. Free memory was 94.6MB in the beginning and 91.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 00:03:55,888 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:03:55,888 INFO L158 Benchmark]: RCFGBuilder took 541.43ms. Allocated memory is still 136.3MB. Free memory was 88.3MB in the beginning and 59.4MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-07 00:03:55,888 INFO L158 Benchmark]: TraceAbstraction took 425620.82ms. Allocated memory was 136.3MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 58.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2021-12-07 00:03:55,889 INFO L158 Benchmark]: Witness Printer took 164.29ms. Allocated memory is still 7.6GB. Free memory was 3.4GB in the beginning and 3.3GB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2021-12-07 00:03:55,890 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.12ms. Allocated memory is still 77.6MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.29ms. Allocated memory is still 136.3MB. Free memory was 113.3MB in the beginning and 94.6MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 136.3MB. Free memory was 94.6MB in the beginning and 91.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.43ms. Allocated memory is still 136.3MB. Free memory was 88.3MB in the beginning and 59.4MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 425620.82ms. Allocated memory was 136.3MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 58.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 164.29ms. Allocated memory is still 7.6GB. Free memory was 3.4GB in the beginning and 3.3GB in the end (delta: 59.4MB). Peak memory consumption was 58.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 t3_pc = 0; [L607] int m_st ; [L608] int t1_st ; [L609] int t2_st ; [L610] int t3_st ; [L611] int m_i ; [L612] int t1_i ; [L613] int t2_i ; [L614] int t3_i ; [L615] int M_E = 2; [L616] int T1_E = 2; [L617] int T2_E = 2; [L618] int T3_E = 2; [L619] int E_M = 2; [L620] int E_1 = 2; [L621] int E_2 = 2; [L622] int E_3 = 2; [L628] int token ; [L630] 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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L1327] COND FALSE !(__VERIFIER_nondet_int()) [L1330] CALL main2() [L1314] int __retres1 ; [L1318] CALL init_model2() [L1227] m_i = 1 [L1228] t1_i = 1 [L1229] t2_i = 1 [L1230] t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1318] RET init_model2() [L1319] CALL start_simulation2() [L1255] int kernel_st ; [L1256] int tmp ; [L1257] int tmp___0 ; [L1261] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1262] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1263] CALL init_threads2() [L883] COND TRUE m_i == 1 [L884] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L888] COND TRUE t1_i == 1 [L889] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L893] COND TRUE t2_i == 1 [L894] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L898] COND TRUE t3_i == 1 [L899] t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1263] RET init_threads2() [L1264] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1020] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1025] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1030] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1035] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1040] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1045] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1050] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1055] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1264] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1265] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L799] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L809] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L811] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L818] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L828] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L830] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L837] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L847] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L849] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L856] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L866] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L868] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L1265] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1266] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1068] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1073] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1078] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1083] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1088] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1093] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1098] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1103] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1266] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1269] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1272] kernel_st = 1 [L1273] CALL eval2() [L939] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L943] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L946] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L908] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L911] COND TRUE m_st == 0 [L912] __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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L934] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L946] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L946] tmp = exists_runnable_thread2() [L948] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L953] COND TRUE m_st == 0 [L954] int tmp_ndt_1; [L955] tmp_ndt_1 = __VERIFIER_nondet_int() [L956] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L967] COND TRUE t1_st == 0 [L968] int tmp_ndt_2; [L969] tmp_ndt_2 = __VERIFIER_nondet_int() [L970] COND TRUE \read(tmp_ndt_2) [L972] t1_st = 1 [L973] CALL transmit1() [L691] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L702] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L704] t1_pc = 1 [L705] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L973] RET transmit1() [L981] COND TRUE t2_st == 0 [L982] int tmp_ndt_3; [L983] tmp_ndt_3 = __VERIFIER_nondet_int() [L984] COND TRUE \read(tmp_ndt_3) [L986] t2_st = 1 [L987] CALL transmit2() [L727] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L738] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L740] t2_pc = 1 [L741] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L987] RET transmit2() [L995] COND TRUE t3_st == 0 [L996] int tmp_ndt_4; [L997] tmp_ndt_4 = __VERIFIER_nondet_int() [L998] COND TRUE \read(tmp_ndt_4) [L1000] t3_st = 1 [L1001] CALL transmit3() [L763] COND TRUE t3_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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L774] 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_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L776] t3_pc = 1 [L777] t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1001] RET transmit3() [L943] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L946] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L908] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L911] COND TRUE m_st == 0 [L912] __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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L934] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L946] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L946] tmp = exists_runnable_thread2() [L948] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L953] COND TRUE m_st == 0 [L954] int tmp_ndt_1; [L955] tmp_ndt_1 = __VERIFIER_nondet_int() [L956] COND TRUE \read(tmp_ndt_1) [L958] m_st = 1 [L959] CALL master() [L633] int tmp_var = __VERIFIER_nondet_int(); [L635] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L646] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L649] token = __VERIFIER_nondet_int() [L650] local = token [L651] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L652] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1160] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L799] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L809] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L811] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L819] COND TRUE E_1 == 1 [L820] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L830] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND TRUE \read(tmp___0) [L1131] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L838] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L847] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L849] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L857] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L866] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L868] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L1160] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L652] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L653] E_1 = 2 [L654] m_pc = 1 [L655] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L959] RET master() [L967] COND TRUE t1_st == 0 [L968] int tmp_ndt_2; [L969] tmp_ndt_2 = __VERIFIER_nondet_int() [L970] COND TRUE \read(tmp_ndt_2) [L972] t1_st = 1 [L973] CALL transmit1() [L691] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L694] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L710] token += 1 [L711] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L712] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1160] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L799] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L800] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L809] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L811] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L819] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L828] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L830] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L838] COND TRUE E_2 == 1 [L839] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L849] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND TRUE \read(tmp___1) [L1139] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L857] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L866] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L868] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L1160] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L712] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L713] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L702] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L704] t1_pc = 1 [L705] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L973] RET transmit1() [L981] COND TRUE t2_st == 0 [L982] int tmp_ndt_3; [L983] tmp_ndt_3 = __VERIFIER_nondet_int() [L984] COND TRUE \read(tmp_ndt_3) [L986] t2_st = 1 [L987] CALL transmit2() [L727] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L730] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L746] token += 1 [L747] E_3 = 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_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L748] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1160] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L799] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L800] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L809] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L811] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L819] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L828] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L830] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L838] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L847] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L849] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L857] COND TRUE E_3 == 1 [L858] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L868] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND TRUE \read(tmp___2) [L1147] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L1160] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L748] 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_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L749] E_3 = 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L738] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L740] t2_pc = 1 [L741] 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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L987] RET transmit2() [L995] COND TRUE t3_st == 0 [L996] int tmp_ndt_4; [L997] tmp_ndt_4 = __VERIFIER_nondet_int() [L998] COND TRUE \read(tmp_ndt_4) [L1000] t3_st = 1 [L1001] CALL transmit3() [L763] COND FALSE !(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L766] COND TRUE t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L782] token += 1 [L783] 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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L784] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1160] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L799] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L800] COND TRUE E_M == 1 [L801] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L811] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND TRUE \read(tmp) [L1123] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L819] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L828] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L830] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L838] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L847] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L849] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L857] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L866] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L868] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L1160] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L784] 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_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L785] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L774] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L776] t3_pc = 1 [L777] t3_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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L1001] RET transmit3() [L943] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=-3, tmp_ndt_4=1, token=3] [L946] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L908] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L911] COND TRUE m_st == 0 [L912] __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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L934] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L946] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=-3, tmp_ndt_4=1, token=3] [L946] tmp = exists_runnable_thread2() [L948] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=-3, tmp_ndt_4=1, token=3] [L953] COND TRUE m_st == 0 [L954] int tmp_ndt_1; [L955] tmp_ndt_1 = __VERIFIER_nondet_int() [L956] COND TRUE \read(tmp_ndt_1) [L958] m_st = 1 [L959] CALL master() [L633] int tmp_var = __VERIFIER_nondet_int(); [L635] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L638] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L660] COND FALSE !(token != local + 3) 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L671] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L672] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L673] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L674] 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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [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_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - 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, 282 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 425.4s, OverallIterations: 49, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.5s, AutomataDifference: 214.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27299 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26796 mSDsluCounter, 46792 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28563 mSDsCounter, 4618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23197 IncrementalHoareTripleChecker+Invalid, 27815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4618 mSolverCounterUnsat, 18229 mSDtfsCounter, 23197 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6199 GetRequests, 5653 SyntacticMatches, 6 SemanticMatches, 540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253212occurred in iteration=34, InterpolantAutomatonStates: 446, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 193.3s AutomataMinimizationTime, 48 MinimizatonAttempts, 110037 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 12114 NumberOfCodeBlocks, 12114 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 11754 ConstructedInterpolants, 0 QuantifiedInterpolants, 20965 SizeOfPredicates, 9 NumberOfNonLiveVariables, 16122 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 72 InterpolantComputations, 48 PerfectInterpolantSequences, 7044/7759 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-07 00:03:55,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43b09939-3088-468d-bc8f-6d55f1186f74/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE